#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<cstring>
using namespace std;

int a[200006];
int b[200006];

int main()
{
    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]);
            if (a[i]>=m) b[i]=1;
            else b[i]=0;
        }
        long long ans=0;
        int flag=0;
        int i,l;
        for (i=1;i<=n;i++)
        {
            if (b[i])
            {
                if (!flag) l=i;
                flag++;
            }
            if (flag==k) break;
        }
        if (flag<k)
        {
            printf("0\n");
            continue;
        }
        ans=l;

        for (i=i+1;i<=n;i++)
        {
            if (b[i])
            {
                for (l=l+1;l<=n;l++)
                {
                    if (b[l]) break;
                }
            }
            ans+=l;
            //cout<<i<<endl;
        }
        printf("%I64d\n",ans);
    }
}