#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

vector<bool> isprime;
vector<int> primes;
void sieve(int n) {
	if((int)isprime.size() >= n + 1) return;
	isprime.assign(n + 1, true);
	isprime[0] = isprime[1] = false;
	int sqrtn = (int)(sqrt(n * 1.) + .5);
	for(int i = 2; i <= sqrtn; i ++) if(isprime[i]) {
		for(int j = i * i; j <= n; j += i)
			isprime[j] = false;
	}
	primes.clear();
	for(int i = 2; i <= n; i ++) if(isprime[i])
		primes.push_back(i);
}

int main() {
	int M; int N;
	while(~scanf("%d%d", &M, &N)) {
		vector<int> C(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &C[i]);
		sieve(M);
		vector<int> dp(M + 1, -1);
		dp[M] = 0;
		rep(i, N) {
			int c = C[i];
			for(int j = M; j >= c; -- j) if(dp[j] != -1)
				amax(dp[j - c], dp[j] + 1);
		}
		int ans = 0;
		for(int p : primes) if(p <= M)
			ans += dp[p] == -1 ? 0 : dp[p];
		ans += M / *min_element(C.begin(), C.end());
		printf("%d\n", ans);
	}
	return 0;
}