#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<bitset>
#include<stack>
using namespace std;
typedef long double ld;
typedef long long ll;
const int N=1e6+10;
int n,k,a[N],id[N],l[N],r[N],st[N],top;
vector<int>v[N];
int main()
{
	int T;scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&k);
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		for(int i=1;i<=n;i++) v[i].clear();
		for(int i=1;i<=n;i++)
		{
			v[a[i]].push_back(i);
			id[i]=v[a[i]].size();
		}
		for(int i=1;i<=n;i++)
		{
			while(top>0&&a[st[top]]<=a[i]) top--;
			l[i]=st[top];
			st[++top]=i;
		}
		st[0]=n+1;top=0;
		for(int i=n;i>=1;i--)
		{
			while(top>0&&a[st[top]]<=a[i]) top--;
			r[i]=st[top];
			st[++top]=i;
		}
		ll ans=0;
		for(int i=1;i<=n;i++)
		{
			int l1=(id[i]>1?v[a[i]][id[i]-2]:0);
			if((id[i]+k-1)<=v[a[i]].size())
			{
				int r1=((id[i]+k)<=v[a[i]].size()?v[a[i]][id[i]+k-1]:n+1);
				int l2=max(l1,l[i])+1,r2=min(r1,r[i])-1;
				if(l2<=i&&v[a[i]][id[i]+k-2]<=r2)
					ans+=1ll*(i-l2+1)*(r2-v[a[i]][id[i]+k-2]+1);
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}