T = int(input())
N = int(input())
t = [int(input()) for _ in range(N)]

# Precompute the sum of time for each possible subset of problems
sum_mask = [0] * (1 << N)
for mask in range(1 << N):
    total = 0
    for i in range(N):
        if mask & (1 << i):
            total += t[i]
    sum_mask[mask] = total

INF = float('inf')
dp = [INF] * (1 << N)
dp[0] = 0  # Base case: no problems solved requires 0 clones

for mask in range(1 << N):
    if dp[mask] == INF:
        continue
    complement = ((1 << N) - 1) ^ mask
    subset = complement
    while True:
        if subset != 0:
            if sum_mask[subset] <= T:
                new_mask = mask | subset
                if dp[new_mask] > dp[mask] + 1:
                    dp[new_mask] = dp[mask] + 1
        if subset == 0:
            break
        subset = (subset - 1) & complement

full_mask = (1 << N) - 1
print(dp[full_mask])