Help the vendor and get some M ^_^

A doll vendor has just received a shipment of dolls from the factory. The vendor can only sell dolls in pairs, and have to ensure that in each pair one doll is K times as large as the other. What is the maximum number of pairs that the vendor can assemble? Each doll can only be sold one time. Now the vendor wants your help to solve this problem. Of course, he will give you 30% of the profit, so, what are you waiting for?

There are multiple test cases.For each case the input contains two integers N (1<=50<=N) and K (1<=K<=25) in first line and N doll sizes (integers between 1 and 100000, inclusive) below, where N is the number of dolls. The doll sizes may separated by white spaces or newline.Input ends when N and K is 0.

For each case, output the maximum number of pairss that the vendor can assemble in one line.

5 2
1 2 1 2 4
0 0

2

Hint: you can sell two pairs at most, {(1,2),(1,2)} or {(1,2),(2,4)}.

scnu