M = 1000000007
T = int(input())
n = int(input())
t = [int(input()) for i in range(n)]
dp = [[M for j in range(n + 1)] for i in range(1 << n)]
dp[0] = [0 for i in range(n + 1)]
for i in range(1, 1 << n):
    for j in range(n + 1):
        if j > 0 and dp[i][j - 1] <= T:
            dp[i][j] = 0
            continue
        for k in range(n):
            if ((i >> k) & 1) == 1:
                dp[i][j] = min(dp[i][j], dp[i ^ (1 << k)][j] + t[k])
for i in range(n + 1):
    if dp[-1][i] == 0:
        print(i)
        break