#include"bits/stdc++.h"

//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a) for(int i=0;i<a;i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 100000000;

int m, n;
int c[10002];
int prime[10002];
int ans[10002];

void get_prime() {//1の時素数、0の時素数ではない
	rep(i, 1, 10001)prime[i] = 1;
	prime[1] = 0;
	prime[2] = 1;
	rep(i, 2, 10001) {
		if (prime[i] == 1) {
			for (int j = i + i; j < 10001; j += i) {
				prime[j] = 0;
			}
		}
	}
	return;
}

int main() {
	cin >> m >> n;
	int mini = mod;
	REP(i, n) { 
		cin >> c[i]; 
		if (c[i] < mini)mini = c[i];
	}
	get_prime();
	PI p;
	queue<PI> que;
	que.push(make_pair(m, 0));
	while (!que.empty()) {
		p = que.front();
		que.pop();
		REP(i, n) {
			if (p.first - c[i] < 0) continue;
			if (prime[p.first - c[i]] == 1) {
				if (ans[p.first - c[i]] == 0) { ans[p.first - c[i]] = p.second+1; }
				else { ans[p.first - c[i]] = max(ans[p.first - c[i]], p.second+1); }
			}
			que.push(make_pair(p.first - c[i], p.second + 1));
		}
	}
	ll answer = 0;
	REP(i, 10001)answer += ans[i];
	answer += m / mini;
	print(answer);
}