#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const double eps = 1e-9;
int N, M;
long long T;
long long A[200005];
vector<pair<long long, long long> > pos;
bool comp(const pair<long long, long long> &s1,
          const pair<long long, long long> &s2) {
  return s1.first < s2.first;
}
struct st {
  long long sum, cant;
  st(long long s = 0, long long c = 0) { sum = s, cant = c; }
} ST[4 * 200005];
void update(int ini, int fin, int lv, int pos, long long val) {
  if (ini == fin) {
    ST[lv].cant = 1;
    ST[lv].sum = val;
    return;
  }
  int mit = (ini + fin) / 2;
  if (pos <= mit)
    update(ini, mit, lv * 2, pos, val);
  else
    update(mit + 1, fin, lv * 2 + 1, pos, val);
  ST[lv].cant = ST[lv * 2].cant + ST[lv * 2 + 1].cant;
  ST[lv].sum = ST[lv * 2].sum + ST[lv * 2 + 1].sum;
}
void build(int ini, int fin, int lv) {
  ST[lv] = st{0, 0};
  if (ini == fin) return;
  int mit = (ini + fin) / 2;
  build(ini, mit, lv * 2);
  build(mit + 1, fin, lv * 2 + 1);
}
int queryp(int ini, int fin, int lv, long long time) {
  if (ini == fin) return ini;
  int mit = (ini + fin) / 2;
  if (ST[lv * 2].sum * 2 >= time) return queryp(ini, mit, lv * 2, time);
  return queryp(mit + 1, fin, lv * 2 + 1, time - ST[lv * 2].sum * 2);
}
int queryc(int ini, int fin, int lv, int a, int b) {
  if (ini > b || fin < a) return 0;
  if (ini >= a && fin <= b) return ST[lv].cant;
  int mit = (ini + fin) / 2;
  return queryc(ini, mit, lv * 2, a, b) +
         queryc(mit + 1, fin, lv * 2 + 1, a, b);
}
long long queryt(int ini, int fin, int lv, int a, int b) {
  if (ini > b || fin < a) return 0;
  if (ini >= a && fin <= b) return ST[lv].sum;
  int mit = (ini + fin) / 2;
  return queryt(ini, mit, lv * 2, a, b) +
         queryt(mit + 1, fin, lv * 2 + 1, a, b);
}
int queryllp(int ini, int fin, int lv, int c) {
  if (ini == fin) return ini;
  int mit = (ini + fin) / 2;
  if (ST[lv * 2].cant >= c) return queryllp(ini, mit, lv * 2, c);
  return queryllp(mit + 1, fin, lv * 2 + 1, c - ST[lv * 2].cant);
}
int solve() {
  int lastp = queryp(0, N, 1, T);
  int cant = queryc(0, N, 1, 1, lastp);
  long long time = 2 * queryt(0, N, 1, 1, lastp);
  int r = (cant % M == 0) ? M : cant % M;
  cant -= r;
  int llastp = queryllp(0, N, 1, cant);
  long long t1 = queryt(0, N, 1, llastp + 1, lastp);
  time -= 2 * t1;
  int ini = llastp + 1, fin = N, p = -1;
  while (ini <= fin) {
    int mit = (ini + fin) / 2;
    int c = queryc(0, N, 1, llastp + 1, mit);
    long long t = queryt(0, N, 1, llastp + 1, mit);
    if (c <= M && t <= T - time) {
      p = mit;
      ini = mit + 1;
    } else {
      fin = mit - 1;
    }
  }
  int nc = 0;
  if (p != -1) nc = queryc(0, N, 1, llastp + 1, p);
  return cant + nc;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int test;
  cin >> test;
  while (test--) {
    cin >> N >> M >> T;
    vector<long long> d;
    pos.clear();
    for (int i = 1; i <= N; i++) {
      cin >> A[i];
      d.push_back(A[i]);
      pos.push_back(pair<long long, long long>(A[i], i));
    }
    sort(d.begin(), d.end());
    d.resize(unique(d.begin(), d.end()) - d.begin());
    sort(pos.begin(), pos.end(), comp);
    build(0, N, 1);
    int p = 0, sol = 0;
    long long ds = T;
    for (auto i : d) {
      while (p < (int)pos.size() && i == pos[p].first)
        update(0, N, 1, pos[p++].second, i);
      int s = solve();
      if (sol < s) {
        sol = s;
        ds = i;
      }
    }
    cout << sol << " " << ds << "\n";
  }
  return 0;
}
