#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;  using i64 = int64_t;  using str = string;
using u32 = uint32_t; using u64 = uint64_t; using usize = size_t;
using f64 = double_t; template <typename T> using vec = vector<T>;
#define times(n, i) for (i64 i = 0; i < (n); ++i)
#define range(n, m, i) for (i64 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i64 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i64 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 m, n;
vec<i32> c;
vec<i32> primes;

void init_primes() {
    i32 tmp[10001];
    upto(2, m, x) {
        tmp[x] = 1;
    }
    range(2, sqrt(m), i) {
        if (tmp[i]) {
            for (int j = 0; i*(j+2) <= m; j++) {
                tmp[i*(j+2)] = 0;
            }
        }
    }
    upto(2, m, x) {
        if (tmp[x])
            primes.append(x);
    }
}

i32 check(i32 p, i32 acc, i32 i, i32 cnt) {
    if (acc < p)
        return -1;
    if (acc == p)
        return cnt;
    if (c.size() <= i)
        return -1;

    downto((acc-p)/c[i], 0, j) {
        i32 ans = check(p, acc-c[i]*j, i+1, cnt+j);
        if (ans > 0)
            return ans;
    }
    return -1;
}

i32 main()
{
    cin >> m >> n;
    c.resize(n);
    times(n, i) {
        cin >> c[i];
    }
    sortall(c);

    init_primes();

    i64 ans = m / c[0];
    times(primes.size(), i) {
        i32 cnt = check(primes[i], m, 0, 0);
        if (cnt > 0)
            ans += cnt;
    }

    cout << ans << endl;
    return 0;
}