#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long

const int N = 2e6 + 5;
int a[N], cost[N];

void solve() {
    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>> cost[i];

    sort(a+1, a+n+1);

    vector<int> b;
    vector<int> c;
    vector<int> div;
    for(int i=1; i<=(n+1)/2; i++) b.push_back(a[i]);
    int mn = 1e9+5;
    for(int i=m; i>=2; i--) {
        if(cost[i] >= mn) continue;
        mn = cost[i];
        c.push_back(cost[i]);
        div.push_back(i);
    }
    reverse(c.begin(), c.end());
    reverse(div.begin(), div.end());

    if(c.size() == 0) {
        cout<< b.back() << endl;
        return;
    }

    int ans = b.back();
    int l = 0, r = ans;
    while(l <= r) {
        int mid = (l+r)>>1;
        vector<int> dp(m+3, 1e9+5);
        dp[mid] = 0;
        int pos = 0;
        for(int i=mid+1; i<=m; i++) {
            dp[i] = c[pos];
            if(i/div[pos] > mid) dp[i] += dp[i/div[pos]];

            while(pos + 1 < c.size()) {
                int costnext;
                costnext = c[pos+1];
                if(i/div[pos+1] > mid) costnext += dp[i/div[pos+1]];
                if(costnext <= dp[i]) {
                    dp[i] = costnext;
                    pos++;
                }
                else break;
            }
        }
        int need = 0;
        for(int e: b) {
            if(e > mid) need += dp[e];
        }
        if(need <= k) {
            ans = min(ans, mid);
            r = mid - 1;
        }
        else l = mid + 1;
    }
    cout<< ans << endl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>> t;
    while(t--) {
        solve();
    }
}