As we all know caterpillars love to eat leaves. Usually, a caterpillar sits on leaf, eats as much of it as it can (or wants), then stretches out to its full length to reach a new leaf with its front end, and finally "hops" to it by contracting its back end to that leaf.
We have with us a very long, straight branch of a tree with leaves distributed uniformly along its length, and a set of caterpillars sitting on the first leaf. (Well, our leaves are big enough to accommodate upto $20$ caterpillars!). As time progresses our caterpillars eat and hop repeatedly, thereby damaging many leaves. Not all caterpillars are of the same length, so different caterpillars may eat different sets of leaves. We would like to find out the number of leaves that will be undamaged at the end of this eating spree. We assume that adjacent leaves are a unit distance apart and the length of the caterpillars is also given in the same unit.
For example suppose our branch had $20$ leaves (placed $1$ unit apart) and $3$ caterpillars of length $3, 2$ and $5$ units respectively. Then, first caterpillar would first eat leaf $1$, then hop to leaf $4$ and eat it and then hop to leaf $7$ and eat it and so on. So the first caterpillar would end up eating the leaves at positions $1,4,7,10,13,16$ and $19$. The second caterpillar would eat the leaves at positions $1,3,5,7,9,11,13,15,17$ and $19$. The third caterpillar would eat the leaves at positions $1,6,11$ and $16$. Thus we would have undamaged leaves at positions $2,8,12,14,18$ and $20$. So the answer to this example is $6$.
-----Input:-----
The first line of the input contains two integers $N$ and $K$, where $N$ is the number of leaves and $K$ is the number of caterpillars. Lines $2,3,...,K+1$ describe the lengths of the $K$ caterpillars. Line $i+1$ ($1 \leq i \leq K$) contains a single integer representing the length of the $i^{th}$ caterpillar.
-----Output:-----
A line containing a single integer, which is the number of leaves left on the branch after all the caterpillars have finished their eating spree.
-----Constraints:-----
- $1 \leq N \leq 1000000000$.
- $1 \leq K \leq 20$.
- The length of the caterpillars lie between $1$ and $N$.
- $50 \%$ of test cases will also satisfy $1 \leq N \leq 10000000$ and $1 \leq K \leq 16$.
-----Sample Input:-----
20 3
3
2
5
-----Sample Output:-----
6
-----Hint:-----
You may use $64$-bit integers (long long in C/C++) to avoid errors while multiplying large integers. The maximum value you can store in a $32$-bit integer is $2^{31}-1$, which is approximately $2 \cdot 10^9$. $64$-bit integers can store values greater than $10^{18}$.
from math import gcd
n, k = list(map(int, input().split()))
a = []
for i in range(k):
    try:
        a += list(map(int, input().split()))
    except:
        pass
ans = n
for i in range(1, 2**k):
    b = bin(i)[2:].rjust(k, "0")
    c = []
    for j in range(k):
        if(b[j] == '1'):
            c.append(a[j])
    lcm = c[0]
    for j in c[1:]:
        lcm *= j // gcd(lcm, j)
    temp = ((n - 1) // lcm) + 1
    if(b.count('1')&1):
        ans -= temp
    else:
        ans += temp
print(ans)


from math import gcd
n, k = list(map(int, input().split()))
a = []
for i in range(k):
    try:
        a += list(map(int, input().split()))
    except:
        pass
ans = n
for i in range(1, 2**k):
    b = bin(i)[2:].rjust(k, "0")
    c = []
    for j in range(k):
        if(b[j] == '1'):
            c.append(a[j])
    lcm = c[0]
    for j in c[1:]:
        lcm *= j // gcd(lcm, j)
    temp = ((n - 1) // lcm) + 1
    if(b.count('1')&1):
        ans -= temp
    else:
        ans += temp
print(ans)

