#include <bits/stdc++.h>

 using namespace std;

 typedef long long LL;

 typedef pair<int, int> pii;

 const int maxn = ;

 int dp[maxn][][];

 int a[maxn];

 int n, k;

 void st(int* a, int* b, int n) {

     for(int i = ; i <= n; i++) dp[i][][] = b[i], dp[i][][] = a[i];

     for(int j = ; ( << j) -  <= n; j++) {

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

             dp[i][j][] = min(dp[i][j-][], dp[i+(<<(j-))][j-][]);

             dp[i][j][] = max(dp[i][j-][], dp[i+(<<(j-))][j-][]);

         }

     }

 }

 pii query(int l, int r) {

     int k = int(log(r-l+) / log(2.0));

     return pii(min(dp[l][k][], dp[r-(<<k)+][k][]), max(dp[l][k][], dp[r-(<<k)+][k][]));

 }

 int main() {

     // freopen("in", "r", stdin);

     int T;

     scanf("%d", &T);

     while(T--) {

         scanf("%d%d",&n,&k);

         for(int i = ; i <= n; i++) scanf("%d", &a[i]);

         st(a, a, n);

         LL ret = ;

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

             int lo = i, hi = n;

             while(lo <= hi) {

                 int mid = (lo + hi) >> ;

                 pii q = query(i, mid);

                 int minn = q.first, maxx = q.second;

                 if(maxx - minn < k) lo = mid + ;

                 else hi = mid - ;

             }

             ret += (hi - i + );

         }

         printf("%I64d\n", ret);

     }

     return ;

 }