A foundry rejects any batch number in 1..N that is a multiple of any of k forbidden distinct primes. Count how many integers in 1..N are divisible by none of the given primes (that is, they survive the sieve).
Input format
Line 1: two integers N and k.
Line 2: k space-separated distinct primes. If k is 0 this line is empty or absent.
Output format
A single integer: the count of integers in 1..N not divisible by any of the given primes.
Constraints
- 1 <= N <= 1000000000
- 0 <= k <= 12
- The primes are distinct and each is at least 2.