#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
#define ll long long
int s[200010];
int main()
{
    int t;
    scanf("%d", &t);
    while(t--) {
        ll n,k,t;
        scanf("%I64d %I64d %I64d", &n, &t, &k);
        s[0] = 0;
        for(int i = 1; i <= n; i++) {
            s[i] = s[i-1];
            int tmp;
            scanf("%d", &tmp);
            if(tmp >= t) s[i]++;
        }
        ll beg = 0, end = k, ans = 0;
        while(end <= n)
        {
            while(s[end] - s[beg] >= k)beg++;
            ans += beg;
            end++; 
        }
        printf("%I64d\n", ans);
    }
    return 0;
}