#include<stdio.h>
#include<algorithm>
#include<string.h>
#define N 200050
using namespace std;
int jilu[N];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        int n,m,k;
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;i++){
            scanf("%d",jilu+i);
        }
        long long ans=0;
        int st=1,ed=1;
        int big=0;
        while(st<=n){
            while(ed<=n&&big<k){
                big+=jilu[ed]>=m;
                ed++;
            }
            if(big>=k)ans+=n-ed+2;
            //printf("%d\n",ed);
            big-=jilu[st]>=m;
            st++;
        }
        printf("%I64d\n",ans);
    }
}