import math

def sieve(n):
    ass = []
    is_prime = [True]*(n+1)
    is_prime[0] = False
    is_prime[1] = False

    for i in range(2, int(math.sqrt(n))+1):
        if not is_prime[i]:
            continue
        for j in range(i*2, n+1, i):
            is_prime[j] = False
    for i in range(n+1):
        if is_prime[i]:
            ass.append(i)
    return ass

m = int(input())
n = int(input())
C = list(map(int, input().split()))

P = sieve(10**4+1)
ans = 0
for p in P:
    if p < m:
        dp = [-1]*(m-p+1)
        dp[0] = 0
        for i in range(m-p+1):
            if dp[i] != -1:
                for c in C:
                    if i+c <= m-p:
                        dp[i+c] = max(dp[i+c], dp[i]+1)
        if dp[-1] != -1:
            ans += dp[-1]
    else:
        break

dp = [-1]*(m+1)
dp[0] = 0
for i in range(m+1):
    if dp[i] != -1:
        for c in C:
            if i+c <= m:
                dp[i+c] = max(dp[i+c], dp[i]+1)
ans += max(dp)
print(ans)