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

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)
full_mask = (1 << N) - 1
dp[full_mask] = 0

bit_counts = [[] for _ in range(N + 1)]
for mask in range(1 << N):
    cnt = bin(mask).count('1')
    bit_counts[cnt].append(mask)

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

print(dp[0])