#include <iostream>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#define inf 999999999
#define mo 1000000007
#define LL long long 
using namespace std;
int a[200100];
int n,m,k,l,r,t,x;
LL ans;

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        ans=0;
        memset(a,0,sizeof(a));
        for (int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            if (x>=m) a[i]=1;
            a[i]+=a[i-1];
        }
        
        l=1;r=k;
        while (r<=n)
        {
            while (a[r]-a[l-1]<k && r<=n) r++;
            if (r>n) break;
            ans+=(n-r+1);
            l++;
        }
        printf("%I64d\n",ans);



    }    
}