#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef set<int>::iterator ssii;
#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)
pair<int, int> crack(int n) {
int st = sqrt(n);
int fac = n / st;
while (n % st) {
st += 1;
fac = n / st;
}
return make_pair(st, fac);
}
inline ll qpow(ll a, int n) {
ll ans = 1;
for(; n; n >>= 1) {
if(n & 1) ans *= 1ll * a;
a *= a;
}
return ans;
}
template <class T>
inline bool chmax(T& a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll ksc(ll a, ll b, ll mod) {
ll ans = 0;
for(; b; b >>= 1) {
if (b & 1) ans = (ans + a) % mod;
a = (a * 2) % mod;
}
return ans;
}
ll ksm(ll a, ll b, ll mod) {
ll ans = 1 % mod;
a %= mod;
for(; b; b >>= 1) {
if (b & 1) ans = ksc(ans, a, mod);
a = ksc(a, a, mod);
}
return ans;
}
template <class T>
inline bool chmin(T& a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
bool _check(int x) {
//
return true;
}
int bsearch1(int l, int r) {
while (l < r) {
int mid = (l + r) >> 1;
if(_check(mid)) r = mid;
else l = mid + 1;
}
return l;
}
int bsearch2(int l, int r) {
while (l < r) {
int mid = (l + r + 1) >> 1;
if(_check(mid)) l = mid;
else r = mid - 1;
}
return l;
}
template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
int n = a.size(), m = b.size();
int i;
for(i = 0; i < n && i < m; i++) {
if (a[i] < b[i]) return true;
else if (b[i] < a[i]) return false;
}
return (i == n && i < m);
}
// ============================================================== //
const int maxn = 500000 + 10;
ll dat[maxn], a[maxn], b[maxn];
int n, m;
ll T;
inline ll sq(ll x) { return x*x; }
void init() {
memset(dat, 0, sizeof dat);
memset(a, 0, sizeof a);
memset(b, 0, sizeof b);
}
inline void merge(int L, int mid, int R) {
int i = L, j = mid+1;
_rep(k, L, R) {
if (j > R || (i <= mid && a[i] <= a[j])) b[k] = a[i++];
else b[k] = a[j++];
}
}
inline ll calc(int L, int r, int R) {
if (R > n) R = n;
int tot = min(m, (R-L+1)>>1);
// a[r+1...R] is new segment
_rep(i, r+1, R) a[i] = dat[i];
sort(a+r+1, a+R+1);
merge(L, r, R);
// quick sort + merge sort ==> b[...] sorted
ll val = 0;
_for(i, 0, tot) val += sq(b[R-i] - b[L+i]);
return val;
}
void solve(int &ans) {
int L = 1, R = 1;
a[1] = dat[1];
while (L <= n) {
int p = 1;
while (p) {
ll val = calc(L, R, R+p);
if (val <= T) {
// valid, update a[...]
R = min(R+p, n);
_rep(i, L, R) a[i] = b[i];
if (R >= n) break;
p <<= 1;
}
else p >>= 1;
}
ans++;
L = R+1;
}
}
int main() {
//freopen("input.txt", "r", stdin);
int kase;
cin >> kase;
while (kase--) {
init();
// get data
scanf("%d%d%lld", &n, &m, &T);
_rep(i, 1, n) scanf("%lld", &dat[i]);
// then solve
int ans = 0;
solve(ans);
printf("%d\n", ans);
}
}