quase primos

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;

vector<ll> primes;
ll ans, number;

void count(int idx = -1,ll val = 1, int cnt = 1){
    if(val > number) return;

    if(cnt%2 == 0) ans -= (number/val);
    else ans += (number/val);
    for(int i = idx+1; i < primes.size(); i++){
        count(i, val*primes[i],cnt+1);
    }
}
int main(){
    int k; cin >> number >> k;
    for(int i = 0; i < k; i++){
        int aux; cin >> aux;
        primes.push_back(aux);
    }
    ans = 0;
    count();
    cout << ans << endl;
    return 0;
}