#include<bits/stdc++.h>
using namespace std;
constexpr int N=1000005;
int n,k;
int a[N];
int lst[N],nxt[N];
vector<int>pos[N];
void solve()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        pos[i].clear();
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        pos[a[i]].emplace_back(i);
    }
    stack<int>s; 
    for(int i=1;i<=n;i++)
    {
        while(!s.empty()&&a[s.top()]<=a[i]) s.pop();
        if(s.empty()) lst[i]=0;
        else lst[i]=s.top();
        s.emplace(i);
    }
    while(!s.empty()) s.pop();
    for(int i=n;i>=1;i--)
    {
        while(!s.empty()&&a[s.top()]<=a[i]) s.pop();
        if(s.empty()) nxt[i]=n+1;
        else nxt[i]=s.top();
        s.emplace(i);
    }
    long long ans=0;
    for(int i=1;i<=n;i++)
    {
        int p=lower_bound(pos[a[i]].begin(),pos[a[i]].end(),i)-pos[a[i]].begin();
        if(p-k+1>=0)
        {
            int ll=lst[i]+1,lr=pos[a[i]][p-k+1];
            int rl=i,rr=nxt[i]-1;
            if(p+1<(int)pos[a[i]].size()) rr=min(rr,pos[a[i]][p+1]-1);
            if(ll<=rr&&rl<=rr) ans+=(long long)(lr-ll+1)*(rr-rl+1);
        }
    }
    cout<<ans<<"\n";
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}