#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<stdio.h>
#include<math.h>
#include<stack>
#include<queue>
#include<map>
#include<vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//#define min(a,b) (a>b?b:a)
//#define max(a,b) (a>b?a:b)
#define mem(a,num) memset(a,num,sizeof(a))
#define inf(a,n) fill(a,a+n,0x3f3f3f3f)

int a[200005];

int main()
{
    int T,n,m,k;
    cin>>T;
    while(T--){
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<n;++i) scanf("%d",&a[i]);
        int sum=0,l=0,r=0,tmp;
        ll ans=0;
        for(int i=0;i<n;++i){
            if(a[i]>=m) sum++;
            if(sum==k){
                tmp=l;
                while(a[l]<m)l++;
                l++;
                ans+=(ll)(l-tmp)*(n-i);
                sum--;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}