from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

T = int(input())
N = int(input())
t = [int(input()) for _ in range(N)]
INF = (1<<30)
dp = [[INF]*(1<<N) for _ in range(N+1)]
dp[0][0] = 0
    
for i in range(1<<N):
    cnd = []
    for j in range(N):
        if (i>>j)&1:
            continue
        else:
            cnd.append(j)
    
    for k in range(N):
        
        for c in cnd:
            
            S = i|(1<<c)
            dp[k][S] = min(dp[k][S],dp[k][i] + t[c])
            if dp[k][S]<=T:
                dp[k+1][S] = 0
          
for i in range(N+1):
    if dp[i][-1]==0:
        print(i)
        exit()