#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
    int x=0;char c=getchar();
    while(c<'0'||c>'9') c=getchar();
    while(c>='0'&&c<='9'){
        x=x*10+c-'0';
        c=getchar();
    }
    return x;
}
const int N=300005;
int n,k,a[N],pre[N],nxt[N],t[N];
int solve(int l,int r){
    if(l>r) return 0;
    if(l==r) return (a[l]-1<=k);
    if(l+1==r) return solve(l,l)+solve(r,r)+(max(a[l],a[r])-2<=k);
    int mid=(l+r)/2,res=solve(l,mid-1)+solve(mid+1,r);
    {
        int maxpre=pre[mid],minlpos=mid,Mx=a[mid];
        for(int R=mid;R<=r;++R){
            Mx=max(Mx,a[R]);
            while(minlpos>=l&&a[minlpos]<=Mx) --minlpos; ++minlpos;
            maxpre=max(maxpre,pre[R]);
            res+=max(0ll,min(mid,R+k+1-Mx)-max(maxpre+1,minlpos)+1);
        }
    }
    {
        int minnxt=nxt[mid],maxrpos=mid,Mx=a[mid],L=mid-1;
        while(a[L]<=a[mid]&&L>=l){
            Mx=max(Mx,a[L]);
            minnxt=min(minnxt,nxt[L]);
            --L;
        }
        for(;L>=l;--L){
            Mx=max(Mx,a[L]);
            while(maxrpos<=r&&a[maxrpos]<=Mx) ++maxrpos; --maxrpos;
            minnxt=min(minnxt,nxt[L]);
            res+=max(0ll,min(minnxt-1,maxrpos)-max(mid,L-k-1+Mx)+1);
            // cout<<Mx<<' '<<minnxt<<' '<<maxrpos<<' '<<L<<' '<<res<<endl;
        }
    }
    // cout<<l<<' '<<r<<' '<<res<<endl;
    return res;
}
signed main(){
    int T=read();
    while(T--){
        n=read();k=read(); a[0]=a[n+1]=19260817;
        for(int i=1;i<=n;++i) a[i]=read(),pre[i]=t[i]=0,nxt[i]=n+1;
        for(int i=1;i<=n;++i) pre[i]=t[a[i]],t[a[i]]=i;
        for(int i=1;i<=n;++i) t[i]=n+1;
        for(int i=n;i>=1;--i) nxt[i]=t[a[i]],t[a[i]]=i;
        // for(int i=1;i<=n;++i) cout<<nxt[i]<<' '; cout<<endl;
        printf("%lld\n",solve(1,n));
    }
    return 0;
}