#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
//using namespace __gnu_pbds;
//tree<int,null_type,std::less<int>,rb_tree_tag,tree_order_statistics_node_update> t;
int T,n,m,k,a[233333];
void sol()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++) scanf("%d",a+i), a[i]=a[i]>=m;
    int rp=0,cur=1;
    long long ans=0;
    for(int i=1;i<=n;i++)
    {
        rp-=a[i-1];
        while(cur<=n&&rp<k) rp+=a[cur++];
        if(rp>=k) ans+=n-cur+2;
    }
    printf("%I64d\n",ans);
}
int main()
{
    scanf("%d",&T);
    while(T--) sol();
}