#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<vector>
#define LL long long
#define INF 0X7FFFFFFF
using namespace std;
int T,N,M,K;
int f[200005];
int qzh[200005]; 
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&N,&M,&K);
        memset(qzh,0,sizeof(qzh));
        for(int i=1;i<=N;i++)
        {
            scanf("%d",&f[i]);
            qzh[i]=qzh[i-1];if(f[i]>=M) qzh[i]++;
        }
        LL ans=0;
        for(int i=1;i<=N;i++)
        {
            int p=K+qzh[i-1];
            int pos=lower_bound(qzh+i,qzh+1+N,p)-qzh;
        //    cout<<p<<' '<<pos<<endl;
            ans+=(N-pos+1);
        }
        printf("%I64d\n",ans);
    }
    return 0;
}