#include <cstdio>
#include <map>
using namespace std;
const int maxn = 1000005;
map<int, int> dict;//数：个数
int q[maxn],nums[maxn];
void print(int h, int t) {
    printf("head=%d tail=%d\n", h, t);
    for (int i = h; i <= t; i++)printf("%d ", q[i]);
    printf("\n");
}

int main() {
    int t, n, k;
    long long  res;
    scanf("%d", &t);
    while (t--) {
        scanf("%d%d", &n, &k);
        for (int i = 0; i < n; i++)scanf("%d", &nums[i]);
        res = 0;
        if (k == 1) { printf("%lld\n", n * (n + 1) / 2); }
        else {
            for (int len = k; len <= n; len++) {
               /* printf("\nlen=%d\n", len);*/
                int head = 0, tail = -1;
                //首先 放第一波
                dict.clear();
                for (int i = 0; i < len - 1; i++) {
                    if (!dict.count(nums[i]))dict[nums[i]] = 0;
                    dict[nums[i]]++;
                    while (head <= tail && nums[q[tail]] <= nums[i])tail--;
                    q[++tail] = i;
                }
                 /*print(head,tail);*/
                 //然后 开始移动
                for (int i = len - 1; i < n; i++) {
                    if (!dict.count(nums[i]))dict[nums[i]] = 0;
                    dict[nums[i]]++;
                    while (head <= tail && nums[q[tail]] < nums[i])tail--;
                    q[++tail] = i;
                    if (i > len - 1)dict[nums[i - len]]--;
                    while (q[head] < i - len + 1) {
                        head++;
                    }
                   /* print(head, tail);
                    printf("max=%d,dict[]=%d\n", nums[q[head]], dict[nums[q[head]]]);*/
                    if (dict[nums[q[head]]] >= k)res++;
                }
            }
            printf("%lld\n", res);
        }
    }
    return 0;
}