#include <bits/stdc++.h>

using llsi = long long signed int;

llsi a[1000006], cost[1000006];

llsi solve(int n, llsi mid) {
    n = (n + 1) / 2;
    llsi res = 0;
    if(mid == 0)
        for(int i = 1; i <= n; ++i) res += cost[a[i] + 1];
    else
    for(int i = 1; i <= n; ++i) {
        if(a[i] <= mid) continue;
        res += cost[(a[i] + mid - 1) / mid];
    }
    return res;
}

void work() {
    llsi n, m, k; std::cin >> n >> m >> k;
    for(int i = 1; i <= n; ++i) std::cin >> a[i];
    for(int i = 1; i <= m; ++i) std::cin >> cost[i];
    for(int i = 2; i <= m; ++i) for(int j = 2; j * i <= m; ++j) cost[i * j] = std::min(cost[i * j], cost[i] + cost[j]);
    for(int i = m - 1; i >= 1; --i) cost[i] = std::min(cost[i], cost[i + 1]);
    cost[m + 1] = 0X0D00072100114514LL;
    for(int i = 2, j = (m + 1) / 2; i < m; ++i) {
        while(i * (j - 1) > m) j--;
        cost[m + 1] = std::min(cost[m + 1], cost[i] + cost[j]);
    }
    for(int i = m; i > 0; --i) cost[i] = std::min(cost[i], cost[m + 1]);
    // for(int i = 1; i <= m; ++i) std::cerr << cost[i] << char(i == m ? 10 : 32);
    std::sort(a + 1, a + n + 1);
    llsi l = 0, r = m;
    while(l < r) {
        llsi mid = (l + r) >> 1;
        if(solve(n, mid) <= k) r = mid;
        else l = mid + 1;
    }
    std::cout << l << char(10);
}

int main() {
    std::ios::sync_with_stdio(false);
    int T; std::cin >> T; while(T--) work();
    return 0;
}