def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    T = int(input[idx])
    idx += 1
    N = int(input[idx])
    idx += 1
    t = []
    for _ in range(N):
        t.append(int(input[idx]))
        idx += 1
    
    # Precompute sum for all subsets
    sum_subset = [0] * (1 << N)
    for s in range(1 << N):
        total = 0
        for i in range(N):
            if s & (1 << i):
                total += t[i]
        sum_subset[s] = total
    
    full_mask = (1 << N) - 1
    INF = float('inf')
    dp = [INF] * (1 << N)
    dp[0] = 0  # No problems solved, 0 workers needed
    
    for mask in range(1 << N):
        if dp[mask] == INF:
            continue
        # Get available problems (not yet solved)
        available = (~mask) & full_mask
        # Generate all non-empty subsets of available
        subset = available
        while True:
            if subset != 0:
                if sum_subset[subset] <= T:
                    new_mask = mask | subset
                    if dp[new_mask] > dp[mask] + 1:
                        dp[new_mask] = dp[mask] + 1
            if subset == 0:
                break
            subset = (subset - 1) & available
    
    print(dp[full_mask])

if __name__ == '__main__':
    main()