For the lab assignment of this week , Shil got N numbers A₁ , A₂, ... A_N. He must assign each of these numbers a unique integer value from 1 to M. Let C_i be the integer assigned to A_i . Shil must assign numbers in such a way that maximum number of A_i are divisible by their C_i . You must print maximum numbers of A_i that could be made divisible by C_i in optimal assignment.

Input:
First Line of input consists of integer N and M.
Next N lines consists of N integers with i^th line containing integer A_i.

Output:
Output maximum number of A_i that can be made divisible by C_i in optimal assignment.

Constraints:

• 1 ≤ N ≤ 10³
• 1 ≤ A_i ≤ 10⁵
• N ≤ M ≤ 10⁵