tjut 5289

include <iostream>
#include <cstdio>

using namespace std;

typedef __int64 ll;

int n, k;
int a[100005], qmax[100005], qmin[100005];

void gao() {
    ll ans = 0;
    int maxf, maxr, minf, minr;
    maxf = maxr = minf = minr = 0;
    qmax[maxr++] = a[0];
    qmin[minr++] = a[0];
    int p, q;//p区间起点，q-1区间终点 
    p = 0, q = 1;
    while(p != n || q != n) {
        if(q != n) {
            while(maxf != maxr && qmax[maxr-1] < a[q]) maxr--;//单调队列操作，队列不为空并且不能保证单调则出队 
            qmax[maxr++] = a[q];                               //入队 
            while(minf != minr && qmin[minr-1] > a[q]) minr--;
            qmin[minr++] = a[q];
        }
        while(p != n && (qmax[maxf]-qmin[minf] >= k || q == n)) {
            ans += q-p;
            if(qmax[maxf] == a[p]) maxf++;
            if(qmin[minf] == a[p]) minf++;
            p++;
        }
        if(q != n) q++;
    }
    printf("%I64d\n", ans);
}

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d%d", &n, &k);
        for(int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        gao();
    }
    return 0;
}