#include <iostream>
#include <cstring>
#include <cassert>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;

bool isp[10010];
int dp[10010];

int main(){
	int M;
	cin >> M;

	int N;
	cin >> N;

	vector<int> C(N);
	for(int i=0;i<N;i++)cin >> C[i];

	memset(dp, -1, sizeof(dp));
	dp[M] = 0;
	for(int i=M;i>=0;i--)if(dp[i] >= 0){
		for(int c : C)if(c <= i){
			dp[i-c] = max(dp[i-c], dp[i] + 1);
		}
	}

	memset(isp, true, sizeof(isp));
	for(int p=2;p*p<=M;p++)if(isp[p]){
		for(int kp=p*p;kp<=M;kp+=p)isp[kp] = false;
	}

	int mn = *min_element(C.begin(), C.end());
	int res = M / mn;
	for(int p=2;p<=M;p++)if(isp[p] && dp[p] > 0){
		res += dp[p];
	}

	cout << res << endl;
	return 0;
}