#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iostream>
using namespace std;
#define ll long long
const int N=2e5+5;

int a[N],sum[N];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,k;
        memset(sum,0,sizeof(sum));
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",a+i);
            sum[i]=sum[i-1]+(a[i]>=m);
        }
        int j=0;
        ll ans=0,ma=0;
        for(int i=1;i<=n;i++)
            while(sum[i]-sum[j]==k)
                ans+=n-i+1,j++;
        printf("%I64d\n",ans);
    }
    return 0;
}