maxN=100010
dp=[-100010]*maxN
dp[0]=0
N=int(input())
K=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(K):
    for j in range(maxN):
        if j+A[i]<maxN:
            dp[j+A[i]]=max(dp[j+A[i]],dp[j]+1)
prime=[1]*maxN
prime[0]=0
prime[1]=0
for i in range(2,maxN):
    if not i:
        continue
    j=i+i
    while j<maxN:
        prime[j]=0
        j+=i

ans=0
for i in range(N+1):
    if prime[i] and dp[N-i]>0:
        ans+=dp[N-i]
print(ans+N//A[0])