#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1e6 + 2;

int64_t cost[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  for (int tc = (cin >> tc, tc); tc--; ) {
    int n, m, k; cin >> n >> m >> k;
    vector<int> a(n);
    for (auto& x: a) cin >> x;
    sort(a.begin(), a.end());
    a.erase(a.begin() + n / 2 + 1, a.end());
    for (int i = 1; i <= m; ++i) cin >> cost[i];
    cost[1] = 0;
    for (int i = 1; i <= m; ++i)
    for (int j = 1; j <= i && i * j <= m; ++j) {
      cost[i * j] = min(cost[i * j], cost[i] + cost[j]);
    }
    if (int64_t rmi = cost[m + 1] = 1.1e9; 1)
    for (int i = 1, j = m; i <= m; ++i) {
      while (i * (j - 1) > m) rmi = min(rmi, cost[--j]);
      cost[m + 1] = min(cost[m + 1], cost[i] + rmi);
    }
    for (int i = m + 1; --i; ) cost[i] = min(cost[i], cost[i + 1]);
    int l = -1, r = m;
    while (r > l + 1) {
      int m = (l + r) / 2;
      int64_t c = 0;
      for (auto& x: a) c += cost[x / (m + 1) + 1];
      (c <= k? r: l) = m;
    }
    cout << r << '\n';
  }
}