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

sum_mask = [0] * (1 << N)
for mask in range(1 << N):
    s = 0
    for i in range(N):
        if mask & (1 << i):
            s += t[i]
    sum_mask[mask] = s

valid = [False] * (1 << N)
for mask in range(1 << N):
    if sum_mask[mask] <= T:
        valid[mask] = True

dp = [float('inf')] * (1 << N)
dp[0] = 0

for mask in range(1, 1 << N):
    lsb = mask & -mask  # Extract the least significant bit
    subset = mask ^ lsb  # Remove the least significant bit from the mask
    s = subset
    while True:
        current_subset = s | lsb  # Always include the least significant bit
        if valid[current_subset]:
            prev_mask = mask ^ current_subset
            if dp[prev_mask] + 1 < dp[mask]:
                dp[mask] = dp[prev_mask] + 1
        if s == 0:
            break
        s = (s - 1) & subset

full_mask = (1 << N) - 1
print(dp[full_mask] if dp[full_mask] != float('inf') else N)