x=50000
import math 
L=math.floor(math.sqrt(x)) # 平方根を求める

Primelist=[i for i in range(x+1)]
Primelist[1]=0 # 1は素数でないので0にする.
 
for i in Primelist:
    if i>L:
        break
    if i==0:
        continue
    for j in range(2*i,x+1,i):
        Primelist[j]=0

Primes=[Primelist[j] for j in range(x+1) if Primelist[j]!=0]
SET=set(Primes)

M=int(input())
N=int(input())
C=sorted(map(int,input().split()))

ANS=0

DP=[0]*(M+1)
DP[0]=1
for c in C:
    for i in range(M+1):
        if DP[i]>0 and i+c<=M:
            DP[i+c]=max(DP[i+c],DP[i]+1)

for i in range(M+1):
    if M-i in SET and DP[i]>1:
        ANS+=DP[i]-1

ANS+=M//C[0]

print(ANS)