#include <cstdio>

int data[200020];

inline int search(int k,int x)
{
    int l = 0,r = x,m;
    int answer = -1;

    while(l <= r)
    {
        m = (l + r) >> 1;
        if(data[m] <= k){
            answer = m;
            l = m + 1;
        }else{
            r = m - 1;
        }
    }

    return answer;
}

int main(void)
{
    int t;
    int n,m,k;
    int i;
    long long total;

    scanf("%d",&t);

    while(t--)
    {
        scanf("%d %d %d",&n,&m,&k);

        for(i = 1;i <= n;++i)
        {
            scanf("%d",&data[i]);
            data[i] = data[i] >= m;
            if(i)
                data[i] += data[i - 1];
        }

        total = 0;
        for(i = k;i <= n;++i)
            total += search(data[i] - k,i) + 1;

        printf("%I64d\n",total);
    }
}