#include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <iostream>

 #include <algorithm>

 #include <queue>

 #include <stack>

 #include <vector>

 #include <set>

 #include <map>

 typedef long long ll;

 #define maxn 100005

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 using namespace std;

 ll n,k;

 ll a[maxn];

 int main(){

     int T;

     while(cin>>T){

         while(T--){

             cin>>n>>k;

             for(int i=;i<=n;i++){

                 cin>>a[i];

             }

             sort(a+,a+n+);

             ll ans=;

             int p;

             for(int i=;i<=n;i++){

                 p=lower_bound(a+,a+i,a[i]-k)-a;

                 ans+=i-p;

             }

             cout<<ans<<endl;

         }

     }

 }