//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 200005;
const int inf = 0x3f3f3f3f;
int m,n,k,a[maxn];
/*==============================head==========================*/
int main(){
    int T; cin >> T; 
    while(T -- > 0){
        ll ans = 0;
        scanf("%d%d%d", &n, &m, &k);
        set0(a);
        for(int i= 1; i<=n; i ++) scanf("%d", &a[i]);
        int ed = 0, cnt = 0;
        int flag = 0;
            //cout<<cnt<<endl;
            /*
            while(cnt >= k){
                flag = 1;
                if(a[st] >= k) cnt--;
                st++;
            }
            */
            /*
            while(cnt >= k ){
                flag = 1;
                if(cnt == k && a[st] >= m) break;
                if(a[st] >= k) cnt --;
                st++;
            }
            */
            for(int i = 1;i <= n;i ++){
                if(a[i-1] >= m) cnt--;
                while(cnt < k && ed < n){
                    ed++;
                    if(a[ed] >= m) cnt++;
                }
            //    cout<<i<<" "<<ed<<endl;
                if(cnt >= k)ans += n - ed + 1;
            }
            // /cout << st<<" "<<j <<endl;
            //if(flag) ans += st - 1;
    //    ans --;
        cout << ans <<endl;
    }
    return 0;
}