#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>

using namespace std;

#define For(i,l,r) for(int i=(l);i<=(r);i++)
#define Down(i,r,l) for(int i=(r);i>=(l);i--)
#define mset(a,x) memset(a,x,sizeof(a))

int a[200005],n,m,k;

void solve()
{
    scanf("%d %d %d",&n,&m,&k);
    For(i,1,n) scanf("%d",&a[i]);
    int l=1,r=0,num=0;
    long long ans=0;
    while(l<=n)
    {
        while(num<k&&r<n)
        {
            r++;
            if(a[r]>=m)
            {
                num++;
            }
        }
        if(num<k) break;
        ans+=n-r+1;
        if(a[l]>=m) num--;
        l++;
    }
    printf("%I64d\n",ans);
}

int main()
{
    //freopen("Maple.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--)
    {
        solve();
    }
    return 0;
}