T,n,*a = map(int,open(0).read().split())
N = 1<<n
lst = [0]*N
for i in range(n):
    for j in range(1<<i):
        lst[j+(1<<i)] = lst[j] + a[i]
for i in range(N):
    lst[i] = int(lst[i] <= T)
for i in range(N):
    for j in range(n):
        if i>>j&1==0 and lst[i|(1<<j)]:
            lst[i] = 0
            break

dp = [n+9]*N
dp[0] = 0
for i in range(N):
    if lst[i] == 0: continue
    for j in range(N):
        dp[j|i] = min(dp[j|i], dp[j]+1)
print(dp[-1])