#define max(p,q)(p>q?p:q)
i,m,n;a[30];
prime[2000]={2,3},s=2;
ma[20010];

x(int*a,int*b){return*a-*b;}
makeprime(){
	int i,n;
	for(n=5;n<10000;n+=2){
		for(i=3;i*i<=n;i+=2)if(n%i==0)break;
		if(n%i)prime[s++]=n;
	}
	prime[s]=1e6;
}
main(){
	int i,j;
	long long ans=0;
	makeprime();
	scanf("%d %d",&m,&n);
	for(i=0;~scanf("%d",a+i);i++);
	a[i]=1e9;
	qsort(a,n,4,x);
	ma[0]=1;
	for(i=0;i<10000;i++)for(j=0;j<n;j++)if(ma[i])ma[i+a[j]]=max(ma[i]+1,ma[i+a[j]]);
	for(i=0;prime[i]<m;i++)if(ma[m-prime[i]])ans+=ma[m-prime[i]]-1;
	printf("%lld",ans+m/a[0]);
	return 0;
}