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

typedef vector<int> vi;
const int MAXN = 1e6 + 5;
int n, m, k;
int a[MAXN];
long long cost[MAXN], Min[MAXN], Out;
bool check(int mid) {
    long long res = 0;
    if(mid == 0) {
        for(int i = 1; i <= (n + 1 >> 1); i++) {
            if(a[i] <= mid) continue;
            res += Min[a[i] + 1];
            if(res > k) return 0;
        }
        return res <= k;
    }
    for(int i = 1; i <= (n + 1 >> 1); i++) {
        if(a[i] <= mid) continue;
        res += Min[a[i] / mid];
        if(res > k) return 0;
    }
    return res <= k;
}
void solve() {
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++) 
        cin >> a[i];
    for(int i = 1; i <= m; i++)
        cin >> cost[i];    
    cost[1] = 0;
    for(int i = 1; i <= m; i++) {
        for(int j = 1; j <= i && i * j <= m; j++) 
            cost[i * j] = min(cost[i * j], cost[i] + cost[j]);
    }
    Min[m] = cost[m];
    for(int i = m - 1; i >= 1; i--) Min[i] = min(Min[i + 1], cost[i]);
    Out = 1e18;
    for(int i = 2; i <= m; i++) {
        int j = m / i + 1;
        Out = min(Out, cost[i] + Min[j]);
    }
    Min[m + 1] = Out;
    for(int i = m; i >= 1; i--) Min[i] = min(Min[i + 1], cost[i]);
    sort(a + 1, a + n + 1);
    int l = 0, r = m, ans = m + 1;
    while(l <= r) {
        int mid = l + r >> 1;
        if(check(mid)) r = mid - 1, ans = mid;
        else l = mid + 1;
    }
    cout << ans << '\n';
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _; for(cin >> _; _; _--) solve();
    return 0;
}
/*
3
3 5 0
2 5 2
3 2 4 6 13
3 5 3
2 5 3
3 2 4 6 13
3 5 6
2 5 2
3 2 4 6 13
*/