8366: HDU1796 - How many integers can you find
[Creator : ]
Description
Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set.
For example, N=12, and M-integer set is {2,3}, so there is another set {2,3,4,6,8,9,10}, all the integers of the set can be divided exactly by 2 or 3. As a result, you just output the number 7.
给定一个数 n，数列 m 个数，求这小于 n 的数中，有多少个数满足能被这 m 个数中任意一个数整除。
For example, N=12, and M-integer set is {2,3}, so there is another set {2,3,4,6,8,9,10}, all the integers of the set can be divided exactly by 2 or 3. As a result, you just output the number 7.
给定一个数 n，数列 m 个数，求这小于 n 的数中，有多少个数满足能被这 m 个数中任意一个数整除。
Input
There are a lot of cases.
For each case, the first line contains two integers $N\ (0<N<2^{31})$ and $M\ (0 < M \leq 10)$.
The follow line contains the M integers, and all of them are different from each other.
For each case, the first line contains two integers $N\ (0<N<2^{31})$ and $M\ (0 < M \leq 10)$.
The follow line contains the M integers, and all of them are different from each other.
Output
For each case, output the number.
Sample 1 Input
12 2
2 3
Sample 1 Output
7