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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define MOD 1000000007
#define HASH_MOD1 998244353
#define HASH_MOD2 1000000009
#define HASH 31
#define ll long long
#define int long long

typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;

template <typename T>
istream& operator>> (istream& in, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        in >> a[i];

    return in;
}

template <typename T>
ostream& operator<< (ostream& out, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        out << a[i] << " ";

    out << "\n";

    return out;
}

template <typename T>
ostream& operator<< (ostream& out, set<T>& s)
{
    for (int x : s)
        out << x << " ";

    out << "\n";

    return out;
}

template <typename T>
ostream& operator<< (ostream& out, vector<pair<T, T>>& v)
{
    for (int i = 0; i < v.size(); ++i)
        out << v[i].first << " " << v[i].second << "\n";

    return out;
}

ll modinv(ll a)
{
    return a <= 1 ? a : MOD - (MOD / a) * modinv(MOD % a) % MOD; 
}

ll binpow(ll x, ll y)
{
    ll ans = 1;

    while (y > 0)
    {
        if (y % 2 == 1)
            ans *= x;

        x = x * x;
        y = y / 2;

        x %= MOD;
        ans %= MOD;
    }

    return ans;
}

void solve()
{
    int n, m, k, i;
    cin >> n >> m >> k;

    vector<int> a(n), cost(m + 1);
    cin >> a;

    for (i = 1; i <= m; ++i)
        cin >> cost[i];

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

    vector<int> min_cost = cost;

    for (i = 1; i <= m; ++i)
    {
        for (int j = i; j <= m; j += i)
            min_cost[j] = min(min_cost[j], min_cost[i] + min_cost[j / i]);
    }    

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

    sort(a.begin(), a.end());

    int ans = 1e9;
    int low = 0;
    int high = a[n - 1];

    while (low <= high)
    {
        int mid = (low + high) / 2;
        int total = 0;

        for (i = 0; i < n / 2 + n % 2; ++i)
        {
            if (a[i] > mid)
                total += min_cost[(a[i] + mid + 1) / (mid + 1)];
        }

        if (total <= k)
        {
            ans = mid;
            high = mid - 1;
        }

        else
            low = mid + 1;
    }

    cout << ans << "\n";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--)
    {
        solve();
    }
}