// A simple Java program to
//count pairs with difference k
import java.util.*;
import java.io.*;
class GFG {
static int countPairsWithDiffK(int arr[],
int n, int k)
{
int count = 0;
// Pick all elements one by one
for (int i = 0; i < n; i++)
{
// See if there is a pair
// of this picked element
for (int j = i + 1; j < n; j++)
if (arr[i] - arr[j] == k ||
arr[j] - arr[i] == k)
count++;
}
return count;
}
// Driver code
public static void main
(String args
[]) {
Scanner sc
=new Scanner
(System.
in); int t=sc.nextInt();
while(t>0){
int n = sc.nextInt();
int k = sc.nextInt();
int []arr=new int[n];
for(int i=0;i<n;i++){
arr[i]=sc.nextInt();
}
int diff=countPairsWithDiffK(arr, n, k);
if(diff>0){
}
else{
}
t--;
}
}
}
Ly8gQSBzaW1wbGUgSmF2YSBwcm9ncmFtIHRvCi8vY291bnQgcGFpcnMgd2l0aCBkaWZmZXJlbmNlIGsKaW1wb3J0IGphdmEudXRpbC4qOwppbXBvcnQgamF2YS5pby4qOwoKY2xhc3MgR0ZHIHsKCglzdGF0aWMgaW50IGNvdW50UGFpcnNXaXRoRGlmZksoaW50IGFycltdLAoJCQkJCQkJCQlpbnQgbiwgaW50IGspCgl7CgkJaW50IGNvdW50ID0gMDsKCgkJLy8gUGljayBhbGwgZWxlbWVudHMgb25lIGJ5IG9uZQoJCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQoJCXsKCQkJLy8gU2VlIGlmIHRoZXJlIGlzIGEgcGFpcgoJCQkvLyBvZiB0aGlzIHBpY2tlZCBlbGVtZW50CgkJCWZvciAoaW50IGogPSBpICsgMTsgaiA8IG47IGorKykKCQkJCWlmIChhcnJbaV0gLSBhcnJbal0gPT0gayB8fAoJCQkJCWFycltqXSAtIGFycltpXSA9PSBrKQoJCQkJCWNvdW50Kys7CgkJfQoJCXJldHVybiBjb3VudDsKCX0KCgkvLyBEcml2ZXIgY29kZQoJcHVibGljIHN0YXRpYyB2b2lkIG1haW4oU3RyaW5nIGFyZ3NbXSkKCXsKCQlTY2FubmVyIHNjPW5ldyBTY2FubmVyKFN5c3RlbS5pbik7CgkJaW50IHQ9c2MubmV4dEludCgpOwoJCXdoaWxlKHQ+MCl7CgkJCgkJaW50IG4gPSBzYy5uZXh0SW50KCk7CgkJaW50IGsgPSBzYy5uZXh0SW50KCk7CgkJaW50IFtdYXJyPW5ldyBpbnRbbl07CgkJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJCWFycltpXT1zYy5uZXh0SW50KCk7CgkJfQoJCWludCBkaWZmPWNvdW50UGFpcnNXaXRoRGlmZksoYXJyLCBuLCBrKTsKCQlpZihkaWZmPjApewoJCQlTeXN0ZW0ub3V0LnByaW50bG4oIllFUyIpOwoJCX0KCQllbHNlewoJCQlTeXN0ZW0ub3V0LnByaW50bG4oIk5PIik7CgkJfQoJCXQtLTsKCQl9Cgl9Cn0KCgo=