## Algorithm

The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. There are so many participants this time that they cannot manage all the numbers. In an urgent meeting they have decided that they will ignore some numbers. But how they will choose those unlucky numbers!!! Mr. NondoDulal who is very interested about historic problems proposed a scheme to get free from this problem. You may be interested to know how he has got this scheme. Recently he has read the Joseph’s problem. There are N tickets which are numbered from 1 to N. Mr. Nondo will choose M random numbers and then he will select those numbers which is divisible by at least one of those M numbers. The numbers which are not divisible by any of those M numbers will be considered for the lottery. As you know each number is divisible by 1. So Mr. Nondo will never select 1 as one of those M numbers. Now given N, M and M random numbers, you have to find out the number of tickets which will be considered for the lottery. Input Each input set starts with two Integers N (10 ≤ N < 2 31) and M (1 ≤ M ≤ 15). The next line will contain M positive integers each of which is not greater than N. Input is terminated by EOF. Output Just print in a line out of N tickets how many will be considered for the lottery.

Sample Input 10 2 2 3 20 2 2 4

Sample Output 3 10

## Code Examples

### #1 Code Example with C Programming

```Code - C Programming```

``````#include #include <bits/stdc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; }

int __fastio = fastio();

typedef long long ll;

ll lcm(ll a, ll b) {
return a*(b/__gcd(a,b));
}

ll cntDiv(ll x, ll d) {
return x/d;
}

void solve() {
ll n, m;
while(cin >> n >> m) {
vector < ll> nums(m);
for(int i=0;i < m;i++) cin >> nums[i];
ll totalDiv = 0;
// PIE
for(int i=1;i < (1 i+It m);i++) {
ll mult = 1;
ll sign = __builtin_popcount(i) % 2 ? 1 : -1;
for(int j=0;j i+It m;j++)
if(i&(1 i+It j))
mult = lcm(mult, nums[j]);
totalDiv += sign*cntDiv(n, mult);
}
cout << (n-totalDiv) i+It "\n";
}
}

int main() {
int t=1;
while(t--) {
solve();
}
}``````
Copy The Code &

Input

cmd
10 2
2 3
20 2
2 4

Output

cmd
3
10