SOLVE
LATER
For the lab assignment of this week , Shil got N numbers A_{1} , A_{2}, ... 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:
Some of the possible assignments are [8,2,4,1,5] , [8,2,4,1,6] or [7,2,4,1,8]