#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.st << ' ' << p.nd << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define Nmax 500005
const long double PI = acos(-1);
 
ll n,m,v[25],ans;
 
inline ll gcd(ll a, ll b){
	ll r = 0;
	while (b){
		r = a % b;
		a = b;
		b = r;
	}
	return a;
}

void count(int k, int nr, ll d){
	if (k == m+1){
		if (nr % 2) ans += (1LL<<(nr-1)) * (n / d);
		else ans -= (1LL<<(nr-1)) * (n / d);
		return;
	}

	count(k+1, nr+1, min(n+1, d * v[k] / gcd(d, v[k])));
	count(k+1, nr, d);
}

int main(){
	freopen("light2.in","r",stdin);
	freopen("light2.out","w",stdout);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i=1;i<=m;i++) cin >> v[i];
 
    count(1,0,1);

    cout << ans << '\n';
    return 0;
}