Continuing our journey on Virat Kohli, we know that Virat is a very successful player. He is so successful because of his competitive nature and he can't tolerate scores less than K. You are given a list of his scores in the previous N matches. Find the number of pairs which have GCD greater than or equal to K.

Input

First lines contains T, the number of test cases.
For each test case, the first line contains N, the number of matches and K.
Next line contains N integers denoting his scores.

Output

For every test case, print the number of pairs in list with GCD >= K.
Constraints

0 < T ≤ 10
0 < N ≤ 10^6
0 < K ≤ 10^6
0 < A_i ≤ 10^6


Example
Input:
1
5 10
10 20 35 25 100

Output:
4