#include <bits/stdc++.h>
#define int long long 
using namespace std;
 
#define mod 1000000007LL
 
    struct Cell{
    int r,c;
    bool operator<(const Cell& other) const{
        if(r!=other.r)return r<other.r;
        return c<other.c;
    }
};
 
class dsu{
    vector<int>parent,rank;
 
private:
    dsu(int n){
        parent.resize(n);
        rank.resize(n);
 
        for(int i=0;i<n;i++){
            parent[i]=i;
            rank[i]=1;
        }
    }
 
    int find(int i){
        return parent[i]==i ? i : (parent[i]=find(parent[i]));
    }
 
    void unite(int x,int y){
        int s1=parent[x];
        int s2=parent[y];
        if(s1!=s2){
            if(rank[s1]<rank[s2])parent[s1]=s2;
            else if(rank[s2]>rank[s1])parent[s2]=s1;
            else parent[s2]=s1, rank[s1]++;
        }
    }
};
 
 
// bool comparator(vector<int>&a , vector<int>&b){
//     return a[2]<b[2];
// }
 
// bool comparator(pair<pair<int,int>,int> &a, pair<pair<int,int>,int> &b ){
//     return a.second > b.second;
// }
 
int t;
int cnt=0;
bool check=false;

int fact(int n){
    int ans=1;
    for(int i=1;i<=n;i++){
        ans=(ans*i)%mod;
    }
    return ans;
}

vector<int> factors(int n){
    vector<int> v;
    for(int i=2;i<n;i++){
        if(n%i==0)v.push_back(i);
    }
    return v;
}

bool is_prime(int n){
    if(n==2 || n==3)return true;
    for(int i=2;i*i<=n;i++){
        if(n%i==0)return false;
    }
    return true;
}

void solve() {
    int n;
    cin>>n;
    int k;
    cin>>k;
    vector<int>v(n);
    for(int i=0;i<n;i++)cin>>v[i];
    // cout<<n<<" n "<<" k ";
    // to count number of subarray whose count of distinct number <=k
    int ans=0;
    unordered_map<int,int>mp;
    for(int i=0,j=0;j<n;j++){
        mp[v[j]]=mp[v[j]]+1;
        int d=mp.size();
        while(d>k){
            mp[v[j]]=mp[v[j]]-1;
            if(mp[v[j]]==0){
                mp.erase(v[j]);
            }
            i++;
            d=mp.size();
        }
        ans+=(j-i+1);
    }
    cout<<ans<<endl;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>t;
    // int t=1;
    while(t--){
        cnt++;
        // cout<<"count value : "<<cnt<<endl;
        solve();
    }
}