#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
typedef vector<vector<ll>> Mat;
//#define int long long
const int N=1e6+10,mod=1e9+7,inf=1e9+1,P=998244353;
const double pi=acos(-1.0),esp=1e-9;
const ll INF=1e18;
void solve()
{
	int n,k;
	cin>>n>>k;
	set<int>s;
	s.insert(0);
	s.insert(n+1);
	vector< vector<int> >pos(n+1);
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		pos[x].pb(i);
	}
	ll ans=0;
	for(int i=n;i;i--){
		if(!pos[i].size())continue;
		int t=0,m=pos[i].size();
		while(t<m){
			int r=*s.upper_bound(pos[i][t]);
			int last=*prev(s.lower_bound(pos[i][t]));
			if(t+k-1<m&&pos[i][t+k-1]<r)
			ans+=1ll*(pos[i][t]-last)*(r-pos[i][t+k-1]);
			
			s.insert(pos[i][t]);
			t++;
		}
	}
	cout<<ans<<'\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
        solve();
    return 0;
}