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

const int N = 1e6 + 10;

int t, n, m, k;
int a[N], cost[N], mn[N << 1];

void init() {
   cin >> n >> m >> k;
   for(int i = 1; i <= n; ++i) cin >> a[i];
   for(int i = 1; i <= m; ++i) cin >> cost[i];
}

int cnt(int med) {
   int ans = 0, tmp = k;
   for(int i = 1; i <= n; ++i) {
      if(a[i] <= med) ans++;
      else {
         int val = a[i] / (med + 1) + 1;
         if(tmp >= mn[val]) {
            tmp -= mn[val];
            ans++;
         }
      }
   }
   return ans;
}

int main() {
   cin.tie(0) -> sync_with_stdio(0);
   if(fopen("Task.inp", "r")) {
      freopen("Task.inp", "r", stdin);
      freopen("WA.out", "w", stdout);
   }

   cin >> t;
   while(t--) {
      init();

      vector<int> vt;
      for(int i = 1; i <= m; ++i) {
         while(!vt.empty() && cost[vt.back()] >= cost[i]) {
            vt.pop_back();
         }
         vt.push_back(i);
      }

      int j = (int) vt.size() - 1;
      for(int i = 1; i <= m + 1; ++i) mn[m + i] = 1e9;
      for(int i = m; i >= 1 ; --i) {
          if(j >= 0 && vt[j] == i) mn[i] = cost[vt[j--]];
          else mn[i] = mn[i + 1];
      }

      for(int i = 1; i <= 2 * m; ++i) {
         if(i * i <= 2 * m) {
            for(int j = 2; j <= i; ++j) {
               mn[i * j] = min(mn[i * j], mn[i] + mn[j]);
            }
         }
         else {
            for(int j = 2; i * j <= 2 * m; ++j) {
               mn[i * j] = min(mn[i * j], mn[i] + mn[j]);
            }
         }
      }

      for(int i = 2 * m; i >= 1; --i) mn[i] = min(mn[i], mn[i + 1]);
      sort(a + 1, a + n + 1);

      int f = 0, l = m, median = a[n / 2 + n % 2];
      while(f <= l) {
         int mid = f + l >> 1;
         if(cnt(mid) >= n / 2 + n % 2) {
            median = mid;
            l = mid - 1;
         }
         else f = mid + 1;
      }

      cout << median << "\n";

      for(int i = 1; i <= n; ++i) mn[i] = 0;
   }
}