#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cmath>
#define logk(x) (int)(log(double(x))/log(2.0))
using namespace std;
const int MAXN = 100000+100;
int a[MAXN*2];

void solve(){
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<n;i++) scanf("%d",&a[i]);
    int l=0,r=0,sum=0;
    if(a[r]>=m) sum++;
    long long ans=0;
    while(r<n){
        if(sum>=k){
            ans+=1LL*(n-r);
            l++;
            if(a[l-1]>=m) sum--;
        }
        else{
            r++;
            if(r>=n) break;
            if(a[r]>=m) sum++;
        }
    }
    cout<<ans<<endl;
}

int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        solve();
    }
}