#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define pb push_back
#define all(x, y) x.begin() + y, x.end()
inline ll read()
{
    ll x = 0, f = 1; char ch = getchar();
    while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
    while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
    return x * f;
}

const int LGN = 1000000;
int lg2[LGN + 1];
//don't forget init value of log2 and calculate function
void lginit()
{
    rep(i, 2, LGN) lg2[i] = lg2[i / 2] + 1;
}
struct ST
{
    vector<vector<ll>> st;
    ll cal(ll x, ll y)
    {
        ll ret = max(x, y);
        return ret;
    }
    void init(vector<int> &a, int n)
    {
        st.resize(n + 1);
        rep(i, 0, n) st[i].resize(21), st[i][0] = a[i];
        rep(i, 1, 20) for (int j = 1; j + (1 << i) - 1 <= n; ++j)
        st[j][i] = cal(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
    }
    ll query(int l, int r)
    {
        int s = lg2[r - l + 1];
        return cal(st[l][s], st[r - (1 << s) + 1][s]);
    }
};

void solve()
{
    int n = read(), k = read();
    vector<int> a(n + 1);
    rep(i, 1, n) a[i] = read();
    ST st;
    st.init(a, n);
    vector b(n + 1, vector<int>());
    rep(i, 1, n)
    {
        b[a[i]].pb(i);
    }
    ll ans = 0;
    rep(i, 1, n)
    {
        int m = b[i].size();
        rep(j, 0, m - k)
        {
            int u = b[i][j], v = b[i][j + k - 1];
            if (st.query(u, v) != i) continue;
            int l, r = u;
            if (j == 0) l = 1;
            else l = b[i][j - 1] + 1;
            while (l < r)
            {
                int mid = l + r >> 1;
                if (st.query(mid, u) == i) r = mid;
                else l = mid + 1;
            }
            int x = l;
            l = v, r = n;
            while (l < r)
            {
                int mid = l + r + 1 >> 1;
                if (st.query(v, mid) == i) l = mid;
                else r = mid - 1;
            }
            int y = l;
            ans += 1ll * (u - x + 1) * (y - v + 1);
        }
    }
    cout << ans;
}

int main()
{
    lginit();
    int t = read();
    while (t--)
    {
        solve();
        if (t) putchar('\n');
    }
    return 0;
}