#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 9, inf = 1e9 + 9;
int a[N], c[N], f[N], dp[N];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t; cin >> t;
  while (t--) {
    int n, m, k; cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
      cin >> c[i];
    }
    f[m] = c[m];
    for (int i = m - 1; i >= 1; i--) {
      f[i] = min(f[i + 1], c[i]);
    }
    for (int i = 1; i <= m + 1; i++) {
      dp[i] = inf;
    }
    dp[1] = 0;
    for (int i = 1; i <= m; i++) {
      for (int j = 2; j * i <= m; j++) {
        dp[j * i] = min(dp[j * i], dp[i] + c[j]);
      }
    }
    for (int i = m - 1; i >= 1; i--) {
      dp[i] = min(dp[i], dp[i + 1]);
    }
    for (int i = 1; i <= m; i++) {
      if (m / i + 1 <= m) dp[m + 1] = min(dp[m + 1], dp[i] + f[m / i + 1]);
    }
    for (int i = m; i >= 1; i--) {
      dp[i] = min(dp[i], dp[i + 1]);
    }
    int l = 0, r = m, ans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      int x = mid;
      vector<int> v;
      for (int i = 1; i <= n; i++) {
        v.push_back(x == 0 ? dp[a[i] + 1] : dp[(a[i] + x - 1) / x]);
      }
      sort(v.begin(), v.end());
      long long sum = 0;
      for (int i = 0; i <= n / 2; i++) {
        sum += v[i];
      }
      if (sum <= k) {
        ans = mid;
        r = mid - 1;
      }
      else {
        l = mid + 1;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}