import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
md = 998244353
# md = 10**9+7

s = II()
n = II()
tt = [II() for _ in range(n)]

def ok(m):
    dp = [(-1, -1) for _ in range(1 << n)]
    dp[0] = (m, 0)

    def chmax(i, val):
        if val > dp[i]: dp[i] = val

    for bit in range(1 << n):
        pp, pt = dp[bit]
        if pp == -1: continue
        for i in range(n):
            if bit >> i & 1: continue
            if tt[i] <= pt:
                chmax(bit | 1 << i, (pp, pt-tt[i]))
            elif pp:
                chmax(bit | 1 << i, (pp-1, s-tt[i]))

    return dp[-1]!=(-1,-1)

l, r = 0, n
while l+1 < r:
    m = (l+r)//2
    if ok(m): r = m
    else: l = m

print(r)