#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10;
int n;
bool book[N];
struct dsu{
    int f[N];
    int sz[N];
    void init(){
        for(int i=1;i<=n;++i){
            f[i]=i;
            sz[i]=1;
        }
    } 
    int get_f(int t){
        if(f[t]==t)return t;
        return f[t]=get_f(f[t]);
    }
    int siz(int t){
        if(!book[t])return 0;
        return sz[get_f(t)];
    }
    void merge(int x,int y){
        x=get_f(x);y=get_f(y);
        if(x==y)return;
        sz[y]+=sz[x];
        f[x]=y;
    }
} d;
int genshin;
int k;
int v=0;
vector<int>vec[N];
void change(int x){
    book[x]=1;
    if(book[x+1])d.merge(x,x+1);
    if(book[x-1])d.merge(x,x-1);
}
int pre[N];
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>genshin;
    while(genshin--){
        cin>>n>>k;
        v=0;
        for(int i=1;i<=n;++i){
            int x;
            cin>>x;
            v=max(v,x);
            vec[x].push_back(i);
        }
        d.init();
        int ans=0;
        for(int i=1;i<=v;++i){
            int lst=0,c0=0;
            for(int j=0;j<vec[i].size();++j){
                int x=vec[i][j];
                pre[x]=d.siz(x-1);
                while(j-lst>=k){
                    change(lst);
                    ++lst;
                }
                int y=vec[i][lst];
                if(j-lst==k-1){
                    // cout<<j<<" "<<lst<<endl;
                    if(pre[x]-pre[y]==x-y){
                        // cout<<x<<" "<<d.siz(x+1)<<endl;
                        ans+=(d.siz(x+1)+1)*(pre[y]+1);
                    }
                }
                change(x);
            }
            vec[i].clear();
        }
        for(int i=0;i<=n+1;++i)book[i]=0;
        // for(int i=1;i<=n;++i)cout<<pre[i]<<" ";
        // cout<<endl;
        cout<<ans<<endl;
    }
    return 0;
}