#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> a(n);
    std::vector<std::vector<int>> pos(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        a[i]--;
        pos[a[i]].push_back(i);
    }

    std::vector<int> l(n, -1);
    std::vector<int> r(n, n);

    std::vector<int> stk;
    for (int i = 0; i < n; i++) {
        while (!stk.empty() && a[stk.back()] <= a[i]) {
            stk.pop_back();
        }
        if (!stk.empty() && a[stk.back()] > a[i]) {
            l[i] = stk.back();
        }
        stk.push_back(i);
    }

    stk.clear();
    for (int i = n - 1; i >= 0; i--) {
        while (!stk.empty() && a[stk.back()] <= a[i]) {
            stk.pop_back();
        }
        if (!stk.empty() && a[stk.back()] > a[i]) {
            r[i] = stk.back();
        }
        stk.push_back(i);
    }

    std::vector<int> nxt(n, n);
    for (int i = 0; i < pos.size(); i++) {
        for (int j = 0; j + k - 1 < pos[i].size(); j++) {
            nxt[pos[i][j]] = pos[i][j + k - 1];
        }
    }

    i64 ans = 0;
    for (int i = 0; i < n; i++) {
        int lo = std::max(0, i - l[i]);
        int hi = std::max(0, r[i] - nxt[i]);
        // std::cerr << i << " " << l[i] << " " << r[i] << " " << nxt[i] << " " << lo * hi << "\n";
        ans += 1LL * lo * hi;
    }

    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}