//It's MyGO!!!
//All OK
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(6)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define LNF (1ll << 60)
#define ll long long
#define ull unsighed long long
// #define int long long
// #define mod 998244353
#define mod 1000000007
using namespace std;

const int N = 1e6 + 10;
int n, m, k;
int idx;
ll a[N], cost[N], suf[N];

int cal(int num, int x){
    if(x == 0){
        return num + 1;
    }
    int y = (num - 1) / x + 1;
    return y;
}

int check(int x){
    ll sum = 0;
    for(int i = n; i; i --){
        if(a[i] <= x) break;
        idx = a[i] / (x + 1) + 1;
        sum += cost[idx];
    }
    return sum <= k;
}

void solve(){
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + 1 + n);
    n = n / 2 + 1;
    for(int i = 1; i <= m + 1; i ++)
        cost[i] = LNF;

    for(int i = 1; i <= m; i ++){
        cin >> cost[i];
        if(i == 1)
            continue;
        else{
            for(int j = i * 2; j <= m; j += i)
                cost[j] = min(cost[j], cost[i] + cost[j / i]);
        }
    }

    suf[m] = cost[m];
    for(int i = m - 1; i; i --)
        suf[i] = min(suf[i + 1], cost[i]);

    for(int i = 2; i <= m; i ++)
        cost[m + 1] = min(cost[m + 1], cost[i] + suf[cal(m + 1, i)]);

    for(int i = m; i >= 1; i --)
        cost[i] = min(cost[i], cost[i + 1]);

    // for(int i = 1; i <= n; i ++)
    //     cout << a[i] << ' ';
    // cout << '\n';
    // for(int i = 1; i <= m; i ++)
    //     cout << cost[i] << ' ';
    // cout << '\n';
    
    int l = 0, r = a[n], ans;
    while(l <= r){
        int mid = l + r >> 1;
        // cout << l << ' ' << r << ' ' << ans << ' ' << mid << endl;
        if(check(mid))
            ans = mid, r = mid - 1;
        else l = mid + 1;
    }
    cout << l << '\n';
    // cout << '\n';
}

signed main(){
    ios;

    // init();
    int _ = 1;
    cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case #" << __ << ": ";

        solve();
    }
    return 0;
}