/*
*Rainto96
*Beijing University of Posts and Telecommunications School of Software
Engineering
*http://blog.csdn.net/u011775691
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <climits>
#include <bitset>
using namespace std;
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define PII pair<int,int>
#define MP(x,y) make_pair((x),(y))
#define ll long long
#define ull unsigned ll
#define scan(x) scanf("%d",&(x))
#define scan2(x,y) scanf("%d%d",&(x),&(y))
#define scan3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z))
#define scan4(x,y,z,k) scanf("%d%d%d%d",&(x),&(y),&(z),&(k))
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
#define fuck(x) cout<<#x<<" "<<x<<endl
const int MX = 202222;
int a[MX];
int dp[MX];
int main(){
    //freopen("/home/rainto96/in.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        int n,m,k;
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        int h = 1,t=1;
        int num= a[1] >= m;
        ll sum=0;
        if(num >= k){
            sum += n;
        }
        while(h<=n){
            while(num >= k){
                if(a[t] >= m) num--;
                t++;
                if(h-t+1 >= k && num >= k) sum += n - h + 1;
            }
            h++;
            if(a[h] >= m) {
                num++;
                if(h-t+1>=k && num >= k) sum += n - h + 1;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}