#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

vector<int> prime_list(int n){
    vector<int> ret;
    ret.pb(2);
    for(int i = 3; i <= n; i++){
        bool ok = true;
        for(int p: ret){
            if(i % p == 0) ok = false;
        }
        if(ok) ret.pb(i);
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int M, N;
    cin >> M >> N;
    vector<int> C(N);
    int min_cost = 10000;
    rep(i, N) {
        cin >> C[i];
        min_cost = min(min_cost, C[i]);
    }
    vector<int> primes = prime_list(M);
    vector<int> cnt(M, 0);
    rep(i, N) cnt[C[i]] = 1;
    rep(i, N){
        rep(j, M){
            if(j + C[i] < M && cnt[j] > 0){
                if(cnt[j + C[i]] == 0){
                    cnt[j + C[i]] = cnt[j] + 1;
                    continue;
                }
                cnt[j + C[i]] = max(cnt[j + C[i]], cnt[j] + 1);
            }
        }
    }
    
    ll ret = 0;
    for(int p : primes){
        ret += cnt[M - p];
//        cout << M - p << ": " << cnt[M - p] << endl;
    }
    ret += M / min_cost;
    
    output(ret, 0);
    
    return 0;
}