Elections

Virtlandia holds a presidential election once every five years. After each vote, the results have to be counted. Here is how ballots are processed in Virtlandia.

There are $n$ voters, so $n$ ballots numbered from 1 to $n$ must be processed. Processing takes $k$ days. Each day, the election committee picks a natural number, then processes every ballot that has not been processed yet and whose number is divisible by the chosen number. On day $i$, all ballots whose numbers are divisible by $a_i$ are processed. When the process ends, some ballots turned out not to be counted. Find how many ballots remain unprocessed.

The first line contains two integers $n$ and $k$ ($1 \le n \le 10^5$, $1 \le k \le 10^4$), the number of voters and the number of days for counting. The second line contains $k$ integers $a_i$ separated by spaces ($2 \le a_i \le n$), the numbers chosen by the election committee on each day.

Print one integer, the answer to the problem: the number of ballots that remain unprocessed.