#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """5
# 3
# 1
# 5
# 3
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

T = int(input())
N = int(input())
A = [int(input()) for _ in range(N)]

dp = [INF] * (1<<N)
dp[0] = 0

for mask in range(1<<N):
    if sum(A[i] for i in range(N) if mask & (1<<i)) <= T:
        dp[mask] = 1

    else:
        t = bin(mask).count('1')
        mask1 = mask
        while mask1:
            # 処理を書く
            mask2 = mask ^ mask1
            t = min(t, dp[mask1] + dp[mask2])

            mask1 = (mask1-1) & mask
        
        dp[mask] = t

ans = dp[(1<<N)-1]
print(ans)