#include <cstring>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <string>
#include <queue>
#include <bitset>
using namespace std;

typedef long long LL;
LL T;
LL n,k;
LL arr[100010];

LL bin_more(LL x,LL m,LL n)
{
    LL l = m;
    LL r = n;
    LL pos = -1;
    while(l <= r)
    {
        LL mid = (l + r) / 2;
        if(arr[mid] >= x)
        {
            r = mid - 1;
            pos = mid;
        }
        else
        {
            l = mid + 1;
        }
    }
    return pos;
}

LL bin_less(LL x,LL m,LL n)
{
    LL l = m;
    LL r = n;
    LL pos = -1;
    while(l <= r)
    {
        LL mid = (l + r) / 2;
        if(arr[mid] <= x)
        {
            l = mid + 1;
            pos = mid;
        }
        else
        {
            r = mid - 1;
        }
    }
    return pos;
}

int main()
{
//    freopen("1.txt","r",stdin);
    scanf("%I64d",&T);
    while(T --)
    {
        scanf("%I64d%I64d",&n,&k);
        for(int i=0;i<n;i++)
        {
            scanf("%I64d",&arr[i]);
        }
        sort(arr,arr+n);
        LL ans = 0;
        for(int i=0;i<n;i++)
        {
            LL l = bin_more(arr[i]-k,0,i-1);
            LL r = bin_less(arr[i]+k,i+1,n-1);
          //  cout << " i " << i << " l " << l << " r " << r << endl;
            if(l != -1) ans += i - l;
            if(r != -1) ans += r - i;
        }

        printf("%I64d\n",ans / 2);
    }
    //while(1);
    return 0;
}