Hardy wants to test Ramanujam of his Mathematical skills. So he gives him a puzzle which is described below.

Puzzle: There are 100 doors, numbered 1,2,....100 .Initially all doors are closed. Now a person comes(lets call him the 1st person)he opens the first door and leaves.

Now a second guy comes and checks the status of second door(open/close) and does the following for every second door starting from door 2, If the door is closed,open it. If the door is already open, leave it as such. After performing the above task, he restores the second door to its initial state(open/close) and leaves.

Now this process goes on till a 100th guy, doing the same procedure ie, The ith person checks the initial status of door numbered i, and then starting from door i, he does the following procedure to every ith door. If the door is closed,open it. If the door is already open, leave it as such. After performing the above task, he restores the ith door to its initial state.(open/close).

Ramanujam now tells that there is a pattern followed in the doors closed and hence he can easily,find if a door is closed or opened. Hearing this Hardy tries to increase the difficulty of the puzzle saying that there are now 500000 doors instead of 100 and he wishes to know, the number of doors that are closed till xth door, given x.Can you help Ramanujam solve this problem?

Input Format: The first line contains two integers n and t,the number of doors present and the number of test cases respectively. Then t lines follow.Each line contains a single integer x.The output should correspond to the value after all 'n' people have done their work.

Output Format: For each input test case, output a number y which indicates the number of closed doors till door numbered x.

Constraints: 1<=t<=100 2<=n<=500000 1<=x<=n