#include<bits/stdc++.h>
#define ll long long
#define int long long

using namespace std;

const int N = 1e6 + 1000;

int a[N], cost[N];
int n, m;
ll k;
int f[N][21];

void rmq_init()  
{
    for (int i = 1; i <= m; i++)
        f[i][0] = cost[i];
    int t = log(m) / log(2) + 1;
    for(int j = 1; j < t; j++)
    {
    	for(int i = 1; i <= m - (1 << j) + 1; i++)
    		f[i][j] = min(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
    }
}

int rmq(int l, int r)
{
    int k = log(r - l + 1) / log(2);
    return min(f[l][k], f[r - (1 << k) + 1][k]);
}

bool ck(int mid)
{
	ll sum = 0;
	for(int i = 1; i <= (n + 1) / 2; i++)
	{
		if(a[i] <= mid) continue;
		int tmp = 0;
		if(mid == 0) tmp = a[i] + 1;
		else tmp = (a[i] + mid - 1) / mid;
		if(tmp > m) return 0;
		sum += rmq(tmp, m);
	}
	// cout << sum << endl;
	if(sum > k) return 0;
	else return 1;
}

signed main()
{
	int t;
	cin >> t;
	while(t--)
	{
		cin >> n >> m >> k;
		for(int i = 1; i <= n; i++)
			cin >> a[i];
		for(int i = 1; i <= m; i++)
			cin >> cost[i];
		
		sort(a + 1, a + 1 + n);
		rmq_init();

		int l = 0, r = 1e18;
		while(l < r)
		{
			int mid = (l + r) / 2;
			// cout << mid << endl;
			if(ck(mid)) r = mid;
			else l = mid + 1;
		}
		cout << l << endl;
	}

	return 0;
}