#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
const int N = 2e5 + 5;
int n, a[N], m, k;

int main() {
    //freopen("86C.txt", "r", stdin);
    int t; scanf("%d", &t);
    while (t--) {
        scanf("%d %d %d", &n, &m, &k);
        for (int i = 1; i <= n; i++) scanf("%d", a + i);
        int d = 0;
        int i = 1, j = 0;
        long long res = 0;
        while (j < n) {
            j++;
            if (a[j] >= m) d++;
            if (d >= k) {
                res += n - j + 1;
                if (a[j] >= m) d--;
                j--;
                if (a[i] >= m) d--;
                i++;
            }
        }
        printf("%I64d\n", res);
    }
}