//#include <bits\stdc++.h>
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <bitset>

#define sqr(x) (x)*(x)
#define lson (p<<1)
#define rson (lson | 1)
#define eps 1e-10
#define pii pair<int,int>
#define mk(x,y) make_pair(x,y)

using namespace std;
typedef long long llg;
const int N = 2e5+10;
int a[N];
int main()
{
    int cas,n,m,k;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        llg l = 0, r = 0, t = 0;
        llg ans = 0;
        for(int i=0;i<n;i++)
        {
            while(t<k && r<n)
            {
                if(a[r]>=m) t++;
                r++;
            }
            if(t>=k) ans = ans +  n - r + 1;
            if(a[i]>=m) t--;
        }
        cout<<ans<<endl;
    }
    return 0;
}