#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 500010
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
ll t,n,m,k;
ll a[MAXN],s[MAXN];
ll re(ll l,ll r){
	ll ans=0;
	for(int k=0;k<=r-l;k++){
		s[k+1]=a[l+k];
	}
	sort(s+1,s+r-l+2);
	for(int i=1;i<=min((r-l+1)/2,m);i++){
		ans+=(s[r-l+2-i]-s[i])*(s[r-l+2-i]-s[i]);
	}
	return ans;
}
ll find(ll now){
	ll l=now,r=n;
	while(l<r){
		ll mid=(l+r+1)/2;
		if(re(now,mid)<=k)l=mid;
		else r=mid-1;
	}
	return l;
}
int main(){
	freopen("cont.in","r",stdin);
	freopen("cont.out","w",stdout);
	t=read();
	while(t--){
		n=read(),m=read(),k=read();
		for(int i=1;i<=n;i++)a[i]=read();
		ll now=1,ansz=0;
		while(now<=n){
			ansz++;
			now=find(now)+1;
		}
		cout<<ansz<<endl;
	}
	return 0;
}