#include "math.h"
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
bool isPrime(int a)
{
    if (a <= 1)
        return false;
    for (int i = 2; i * i <= a; i++) {
        if (a % i == 0)
            return false;
    }
    return true;
}
int main()
{
    int m, n;
    int c[10005];
    cin >> m >> n;
    rep(i, n) cin >> c[i];
    lli dp[100005] = {};
    rep(i, 100005) dp[i] = -1;
    dp[m] = 0;
    rep(i, n)
    {
        rrep(j, m + 1)
        {
            if (dp[j] >= 0 && j - c[i] >= 0) {
                dp[j - c[i]] = max(dp[j] + 1, dp[j - c[i]]);
            }
        }
    }
    lli ans = 0;
    rrep(i, m)
    {
        if (isPrime(i) && dp[i] >= 0) {
            ans += dp[i];
        }
    }
    ans += m / (*min_element(c, c + n));
    cout << ans << endl;
}