Perfect Sequence (25)

输入描述:

Each input file contains one test case. For each case, the first line contains two positive integers N and p, where N (<= 
105) is the number of integers in the sequence, and p (<= 109) is the parameter. In the second line there are N 
positive integers, each is no greater than 109.

输出描述:

For each test case, print in one line the maximum number of integers that can be chosen to form a perfect subsequence.