#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<iostream>

using namespace std;

int t , n , k , m , x , a[300000];

int main() {
    scanf( "%d" , &t );
    while( t-- ) {
        scanf( "%d%d%d" , &n , &m , &k );
        for( int i = 1 ; i <= n ; i++ ) {
            scanf( "%d" , &x );
            a[i] = x >= m;
        }
        a[0] = 0;
        for( int i = 1 ; i <= n ; i++ )
            a[i] += a[i-1];
        long long ans = 0;
        for( int i = 1 , j = 1 ; i <= n ; i++ ) {
            while( j <= n && a[j]-a[i-1] < k )
                j++;
            if( j > n )
                continue;
            ans += n-j+1;
        }
        cout << ans << endl;
    }
    return 0;
}