Max Possible Frequency :
Difficulty Level : Medium
Submissions : 152
Asked In :
Marks :100
: 5 | : 0
You are given a array A of size N ($$$A_i,A_{i+1}.......A_{n-1}$$$).
You can perform the following operation as many times as you want :
Select an integer X and add it to each element of the Array.
You are also given the integer Y. Your task is to return the maximum possible frequency of y after performing the above operation optimally on the array.
Input
The first line of the test case contains an integer N and Y. The number of elements in the array and integer Y . ($$$1 \le N \le 10^5$$$) and ($$$-10^5 \le Y \le 10^5$$$).
The next line contains N integers of the array.
Output
For each test case print the maximum possible frequency.
Examples
Input
4 2 1 3 4 5
Output
1
Input
2 -10 1 1
Output
2
