INF = 1 << 60
T = int(input())
N = int(input())
ts = [int(input()) for _ in range(N)]

bit_all = (1 << N) - 1
dp = [[INF] * (1 << N) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):  # 箱 i
    for b in range(1 << N):
        for j in range(N):  # 次に入れる荷物 j
            if dp[i][b] == INF:
                if b & (1 << j):
                    pb = b ^ (1 << j)
                    if dp[i+1][pb] + ts[j] <= T:
                        dp[i+1][b] = min(dp[i+1][b], dp[i+1][pb] + ts[j])
            else:
                nb = b | (1 << j)
                dp[i+1][nb] = min(dp[i+1][nb], ts[j])

for i in range(1, N+1):
    if dp[i][bit_all] < INF:
        print(i)
        break