#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
template <class TE, class TS>
struct OrderedTree {
  static const int MAXN = 1e6 + 5;
  static const int LOGN = 20;
  int tr[LOGN + 1][MAXN];
  TS sm[LOGN + 1][MAXN];
  void insert(int x, TE t) {
    for (int i = 0; i < LOGN; i++) {
      tr[i][x]++;
      sm[i][x] += t;
      x >>= 1;
    }
  }
  void erase(int x, TE t) {
    for (int i = 0; i < LOGN; i++) {
      tr[i][x]--;
      sm[i][x] -= t;
      x >>= 1;
    }
  }
  TE kthelm(int k) {
    TE res = 0;
    int a = 0, b = LOGN;
    while (b--) {
      a <<= 1;
      k -= tr[b][a] < k ? tr[b][a++] : 0;
      res = sm[b][a] / tr[b][a];
    }
    return res;
  }
  TS kthsum(int k) {
    if (!k) return 0;
    TS res = 0;
    int a = 0, b = LOGN;
    while (b--) {
      a <<= 1;
      if (tr[b][a] < k) {
        res += sm[b][a];
      }
      k -= tr[b][a] < k ? tr[b][a++] : 0;
      if (!b) res += sm[b][a] / tr[b][a] * k;
    }
    return res;
  }
};
OrderedTree<long long, long long> odtree;
const int maxn = 2e5 + 5;
int n, m;
long long t;
int p[maxn];
void chemthan() {
  int test;
  cin >> test;
  while (test--) {
    cin >> n >> m >> t;
    vector<pair<int, int> > vals;
    for (int i = (0); i < (n); ++i)
      cin >> p[i], vals.push_back(make_pair(p[i], i));
    sort((vals).begin(), (vals).end());
    pair<int, int> res;
    int ptr = 0;
    for (int i = (0); i < (int((vals).size())); ++i) {
      while (ptr < int((vals).size()) && vals[ptr].first <= vals[i].first) {
        odtree.insert(vals[ptr].second, vals[ptr].first);
        ptr++;
      }
      int lo = 0, hi = ptr;
      while (lo < hi) {
        int mi = lo + hi + 1 >> 1;
        long long sum = odtree.kthsum(mi);
        long long sum2 = odtree.kthsum((mi - 1) / m * m);
        if (sum2 * 2 + sum - sum2 <= t) {
          lo = mi;
        } else {
          hi = mi - 1;
        }
      }
      chkmax(res, make_pair(lo + hi >> 1, vals[i].first));
    }
    for (int i = (0); i < (n); ++i) odtree.erase(i, p[i]);
    if (res.second > t) res.second = t;
    cout << res.first << " " << res.second << "\n";
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
