#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

const int MaxN = 2e5;
int a[MaxN + 5], n, T, m, k;

int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d%d", &n, &m, &k);
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        int sum = 0; int l = 1;
        LL ans = 0;
        for(int r = 1; r <= n; r++)
        {
            if(a[r] >= m) sum++;
            while(sum >= k)
            {
                ans += (n - r + 1);
                if(a[l] >= m) sum--;
                l++;
            }
        }
        printf("%I64d\n", ans);
    }
}