#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " = " << x << '\n'

// #define int long long
#define ll long long
#define endl '\n'

const int N = 1e6 + 10;

char *p1,*p2,buf[100000];
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int read() {
    int x=0,f=1;
    char ch=nc();
    while(ch<48||ch>57)
    {
        if(ch=='-')
            f=-1;
        ch=nc();
    }
    while(ch>=48&&ch<=57)
        x=x*10+ch-48,ch=nc();
   	return x*f;
}

int n, m, k;
ll c[N], suf[N];
int a[N];
ll dp[N];
vector<array<ll, 2>> seg[N];
multiset<ll> st;

inline int check(int x) {
    st.clear();
    for (int i = 0; i <= m + 1; ++i) seg[i].clear(), dp[i] = 1e9 + 10;

    for (int i = 1; i <= a[(n + 1) / 2]; ++i) {
        for (auto [x, s] : seg[i]) {
            if (s == 1) st.insert(x);
            else st.erase(st.find(x));
        }
        if (st.size()) dp[i] = *st.begin();
        dp[i] = min(dp[i], suf[i + 1]);
        if (i <= x) dp[i] = 0;
        for (int j = 2; j * i <= m; ++j) {
            int l = j * i, r = min(m + 1, j * (i + 1));
            // printf("l = %d r = %d res = %d\n", l, r, dp[i] + c[j]);
            seg[l].push_back({dp[i] + c[j], 1});
            seg[r].push_back({dp[i] + c[j], -1});
        }
    }

    // for (int i = 1; i <= m; ++i) {
    //     printf("dp[%d]=%d\n", i, dp[i]);
    // }

    ll need = 0;
    for (int i = 1; i <= (n + 1) / 2; ++i) {
        if (a[i] >= x) need += dp[a[i]];
        if (need > k) return 0;
    }
    return need <= k;
}

void solve() {
    n = read();
    m = read();
    k = read();

    for (int i = 1; i <= n; ++i) a[i] = read();
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= m; ++i) c[i] = read();

    suf[m + 1] = 1e9 + 10;
    for (int i = m; i >= 1; --i) {
        suf[i] = min(suf[i + 1], c[i]);
    }

    int l = 0, r = a[(n + 1) / 2], cnt = 20;
    while (l < r && cnt) {
        cnt--;
        int mid = (l + r) >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }
    cout << l << '\n';
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    t = read();
    while(t--) solve();
}