#include<bits/stdc++.h>
using namespace std;

const int N=300005;

int L[N],R[N];
int a[N],n,K;

int vis[N];

int lg[N],st[19][N];
int cmp(int i,int j){return a[i]>=a[j]?i:j;}
void init(){
    for(int i=2;i<=n;i++)lg[i]=lg[i>>1]+1;
    for(int j=1;j<=18;j++)
        for(int i=1;i+(1<<j)-1<=n;i++)
            st[j][i]=cmp(st[j-1][i],st[j-1][i+(1<<j-1)]);
}
int rmq(int l,int r){
    int len=lg[r-l+1];
    return cmp(st[len][l],st[len][r-(1<<len)+1]);
}

long long ans;
void solve(int l,int r){
    if(l>r)return;
    int mid=rmq(l,r);
    if(mid-l<=r-mid){
        for(int i=mid;i>=l;i--){
            int least=max(mid,a[mid]+i-1-K);
            int most=min(r,R[i]);
            if(least<=most)ans+=most-least+1;
        }
    }else{
        for(int i=mid;i<=r;i++){
            int least=max(L[i],l);
            int most=min(mid,K+1+i-a[mid]);
            if(least<=most)ans+=most-least+1;
        }
    }
    solve(l,mid-1),solve(mid+1,r);
}

void sc(){
    scanf("%d%d",&n,&K);
    ans=0;
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),st[0][i]=i;
    int ptr=1;
    for(int i=1;i<=n;i++)vis[i]=0;
    for(int i=1;i<=n;i++){
        vis[a[i]]++;
        while(vis[a[i]]>1){
            vis[a[ptr]]--;
            ptr++;
        }
        L[i]=ptr;
    }
    for(int i=1;i<=n;i++)vis[i]=0;
    ptr=n;
    for(int i=n;i>=1;i--){
        vis[a[i]]++;
        while(vis[a[i]]>1){
            vis[a[ptr]]--;
            ptr--;
        }
        R[i]=ptr;
    }
    init();
    solve(1,n);
    printf("%lld\n",ans);
}

int main() {
    int T;scanf("%d",&T);
    while(T--)sc();
    return 0;
}