Given an array of N integers, the task is to find all pairs with difference less than K.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains two integers N & K and the second line contains N space separated array elements.
Output: For each test case, print the count of required pairs in new line.