{"trustable":false,"sections":[{"title":"Statement","value":{"format":"MD","content":"In the future,LeeShoW is in great problem with their latest game ‘Pokémon Sleep’. There are a lot of Pokémon serial this time that they can\u0027t manage all the serials. In a discussion meeting they have decided that they will cancel some serials. But how they will choose those unlucky Pokemons!!!\nLeeShoW have a interested about problems proposed a method to get free from this problem.\nYou may be interested to know how he has got this method. Recently he has read the Joseph’s\nproblem.\nThere are $N$ Pokémon serials which are numbered from $1$ to $N$. LeeShoW will choose $M$ random serials and then he will select those serials 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 numbers.\nAs you know each number is divisible by $1$. So LeeShoW will never select $1$ as one of those $M$.\nnumbers. Now given $N, M$ and $M$ random numbers, you have to find out the number of serials which will be considered for the \u0027Pokémon Sleep\u0027.\n"}},{"title":"Input","value":{"format":"MD","content":"Each testcase have two lines,\nThe first line contain two integers $N (10 ≤ N \u003c 2^{31})$ and $M (1 ≤ M ≤ 15). $---The $n$ and $m$ as the statement.\nThe second line contain $M$ positive integers each of which is not greater than $N$.\nInput is end by EOF."}},{"title":"Output","value":{"format":"MD","content":"Print a integer $N$ the serial how many will be considered for the \u0027Pokémon Sleep\u0027."}},{"title":"Sample-input","value":{"format":"MD","content":"10 2\n2 3\n20 2\n2 4"}},{"title":"Sample-output","value":{"format":"MD","content":"3\n10"}}]}