#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#define ull unsigned long long
#define ll long long
#define d double
using namespace std;
const int maxn=100233,mxnode=maxn<<1;
int lc[mxnode],rc[mxnode],add[mxnode],tot;
ll sm[mxnode];
struct zs{int col,pos;}a[maxn];int st[maxn],top;
struct zs1{int x1,x2,y1,y2;}b[maxn];int cnt;
struct zs2{int x1,x2,y2;};priority_queue<zs2>q;
int i,j,k,n,m,L,R,X;

int ra;char rx;
inline int read(){
    rx=getchar(),ra=0;
    while(rx<'0'||rx>'9')rx=getchar();
    while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra;
}


void build(int a,int b){
    int x=++tot;
    if(a==b)return;
    int mid=a+b>>1;
    lc[x]=tot+1,build(a,mid),rc[x]=tot+1,build(mid+1,b);
}
void insert(int x,int a,int b){
    if(L<=a&&R>=b){
        add[x]++,sm[x]=b-a+1;return;
    }
    int mid=a+b>>1;
    if(L<=mid)insert(lc[x],a,mid);
    if(R>mid)insert(rc[x],mid+1,b);
    if(add[x])sm[x]=b-a+1;else sm[x]=sm[lc[x]]+sm[rc[x]];
}
void del(int x,int a,int b){
    if(L<=a&&R>=b){
        add[x]--;
        if(add[x])sm[x]=b-a+1;else sm[x]=sm[lc[x]]+sm[rc[x]];
        return;
    }
    int mid=a+b>>1;
    if(L<=mid)del(lc[x],a,mid);
    if(R>mid)del(rc[x],mid+1,b);
    if(add[x])sm[x]=b-a+1;else sm[x]=sm[lc[x]]+sm[rc[x]];
}

inline void spec(){
    n=cnt=read();
    for(i=1;i<=n;i++)b[i].x1=read(),b[i].y1=read(),b[i].x2=read(),b[i].y2=read();
}

bool cmpa(zs a,zs b){return a.col<b.col||(a.col==b.col&&a.pos<b.pos);}
bool cmpb(zs1 a,zs1 b){return a.y1<b.y1;}
bool operator <(zs2 a,zs2 b){return a.y2>b.y2;}
int main(){
    build(1,100000);
    for(int t=read();t;t--){
            cnt=0;
        n=read(),X=read();
        for(i=1;i<=n;i++)a[i].col=read(),a[i].pos=i;
        sort(a+1,a+1+n,cmpa);
        for(i=1;i<=n;){
            int r;
            for(r=i;r<n&&a[r+1].col==a[i].col;r++);//printf("     %d--%d\n",i,r);
            if(r-i+1<X){i=r+1;continue;}
            for(j=i,top=0;j<=r;j++)st[++top]=a[j].pos;
            st[0]=0,st[top+1]=n+1;
//            for(j=1;j<=top;j++)printf("           %d",st[j]);puts("");
            for(j=X;j<=top;j++)
                b[++cnt].x1=st[j-X]+1,b[cnt].y1=st[j],b[cnt].x2=st[j-X+1],b[cnt].y2=st[j+1]-1,
//                printf("     %d--%d  %d--%d\n",b[cnt].x1,b[cnt].x2,b[cnt].y1,b[cnt].y2);
            i=r+1;
        }
        sort(b+1,b+1+cnt,cmpb);int top=1;
        while(!q.empty())q.pop();
        memset(add,0,(tot+1)<<2),memset(sm,0,(tot+1)<<3);
        
        ll ans=0;
        for(i=1;i<=n;i++){
            while(top<=cnt&&b[top].y1==i)
                L=b[top].x1,R=b[top].x2,insert(1,1,100000),
                q.push((zs2){L,R,b[top].y2}),top++;
            while(!q.empty()&&q.top().y2<i)
                L=q.top().x1,R=q.top().x2,del(1,1,100000),
                q.pop();
            ans+=sm[1];
        }
        printf("%I64d\n",ans);
    }
}