/*****************************************************************
    Author:lbn187, a konjac TwT
    Date:2015-7-17
    Contest:Bestcoder
    Algorithm:QAQ
    ^_^  Orz hzh, NOI gold members, IOI 2016 world champion
    ^=^  Orz hhw, you are our blue moon, with you will live
    ^~^  Orz mxh, you are our red sun, without you we'll die
    ^-^  Orz yizhou, I wish you a successful marriage
    ^w^  Orz xianyangyu, you can sleep all the time in the game
*****************************************************************/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<map>
#include<vector>
#include<set>
#include<bitset>
#define fon(i,n) for(int i=0;i<n;i++)
#define frn(i,n) for(int i=1;i<=n;i++)
#define drn(i,n) for(int i=n;i;i--)
#define don(i,n) for(int i=n-1;i>=0;i--)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mjj(i,x) for(int i=fir[x];i;i=ne[i])
#define X first
#define Y second
#define MAX(a,b) a=max(a,b)
#define MIN(a,b) a=min(a,b)
#define mp make_pair
#define rlr son[son[root][1]][0] 
#define gi(a) scanf("%d",&a);
#define gi2(a,b) scanf("%d%d",&a,&b);
#define gi3(a,b,c) scanf("%d%d%d",&a,&b,&c);
#define gl(a) scanf("%I64d",&a);
#define gs(s) scanf("%s",s);
#define pi(a) printf("%d\n",a);
#define pi2(a,b) printf("%d %d\n",a,b);
#define pl(a) printf("%I64d\n",a);
#define spr(x) (x*x)
#define pie acos(-1) 
#define CP(a,b) memcpy(a,b,sizeof(a))
#define CL(a) memset(a,0,sizeof(a))
#define N 222222
#define M 222222
#define inf 1e9
#define eps 1e-8
using namespace std;

char ch;void read(int &x){for(ch=getchar();ch<'0';ch=getchar());for(x=0;ch>='0';ch=getchar())x=x*10+ch-'0';}
const int xx[]={1,-1,0,0},yy[]={0,0,1,-1};
long long an;
int T,n,m,k,x,y,i,j,t,L,tot,cnt,a[N],b[N],v[N],E[N*3],co[N*3];vector<int>V[N];
struct P{int l,r,x,z;}p[N*10];bool cmp(P a,P b){return a.x<b.x;}
void add(int X1,int X2,int Y1,int Y2){
    t++;p[t].l=X1;p[t].r=X2;p[t].x=Y1;p[t].z=1;
    t++;p[t].l=X1;p[t].r=X2;p[t].x=Y2+1;p[t].z=-1;
}
//void AD(int k,int z){E[k]+=z;lz[k]+=z;}
//void pd(int k){if(lz[k])AD(k<<1,lz[k]),AD(k<<1|1,lz[k]),lz[k]=0;}
void ps(int k,int l,int r){
    if(co[k])E[k]=r-l+1;else if(l==r)E[k]=0;else E[k]=E[k<<1]+E[k<<1|1];
}
void ins(int k,int l,int r,int x,int y,int z){
    if(x<=l&&r<=y){co[k]+=z;ps(k,l,r);return;}int md=l+r>>1;
    if(x<=md)ins(k<<1,l,md,x,y,z);if(y>md)ins(k<<1|1,md+1,r,x,y,z);
    ps(k,l,r);
}
int main(){
    for(scanf("%d",&T);T--;){
        scanf("%d%d",&n,&k);an=0;t=0;CL(E);CL(co);
        for(i=1;i<=n;i++)V[i].clear();
        for(i=1;i<=n;i++)scanf("%d",&a[i]),v[i]=a[i];
        sort(v+1,v+n+1);cnt=unique(v+1,v+n+1)-v-1;
        for(i=1;i<=n;i++)a[i]=lower_bound(v+1,v+cnt+1,a[i])-v,V[a[i]].push_back(i);
        for(x=1;x<=cnt;x++){
            for(L=V[x].size(),i=0;i<L;i++)b[i+1]=V[x][i];b[L+1]=n+1;
            for(i=k;i<=L;i++)add(b[i-k]+1,b[i-k+1],b[i],b[i+1]-1);
        }

        for(sort(p+1,p+t+1,cmp),i=j=1;i<=n;i++){
            for(;p[j].x==i&&j<=t;j++)ins(1,1,n,p[j].l,p[j].r,p[j].z);
            an+=E[1];
        }
        printf("%lld\n",an);
    }
}