#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long

const int INF=1e9+7;
const int N=1e6+10;
const int M=1e8+7;
const int M2=1e9+13;
const double pi=3.1415926535897932384626433832795028841971; 

int arr[N], trees[4*N];

void build(int node, int start, int end)
{
	if(start == end)
	{
        // Leaf node will have a single element
		trees[node] = arr[start];
	}
	else
	{
		int mid = (start + end) / 2;
        // Recurse on the left child
		build(2*node, start, mid);
        // Recurse on the right child
		build(2*node+1, mid+1, end);
        // Internal node will have the sum of both of its children
		trees[node] = min(trees[2*node] , trees[2*node+1]);
	}
}

int query(int node, int start, int end, int l, int r)
{
	if(r < start or end < l)
	{
        // range represented by a node is completely outside the given range
		return INF;
	}
	if(l <= start and end <= r)
	{
        // range represented by a node is completely inside the given range
		return trees[node];
	}
    // range represented by a node is partially inside and partially outside the given range
	int mid = (start + end) / 2;
	int p1 = query(2*node, start, mid, l, r);
	int p2 = query(2*node+1, mid+1, end, l, r);
	return min(p1 , p2);
}

void solve(int t)
{
	int n, m, k;
	cin >> n >> m >> k;
	vector<int>v, c(m+2), dp(m+2);
	for(int i=0;i<n;i++)
	{
		int x;
		cin >> x;
		v.push_back(x);
	}
		for(int i=1;i<=m;i++)cin >> dp[i];
		for(int i=1;i<=m;i++)
		{
			for(int j=1;i*j<=m;j++)dp[i*j] = min(dp[i*j], dp[i]+dp[j]);
		}

		for(int i=1;i<=m;i++)arr[i] = dp[i];
		sort(v.begin(), v.end());
		build(1, 1, m);
		int help = INF;
		for(int i=1;i<=m;i++)
		{
			int tmp = (m+1)/(i+1);
			tmp++;
			tmp = query(1, 1, m, tmp, m);
			help = min(help , tmp + dp[i]);	
		}
		//cout << help << " ";
		dp[m+1] = arr[m+1] = help; 
		build(1, 1, m+1);
		int lo = 1, hi = m, ans = -1;
	//cout << query(1, 1, m+1, m+1, m+1) << "\n"; 
		while(lo<=hi)
		{
			int mid = (lo+hi)/2;
			int c = 0;
			for(int i=0;i<=(n/2);i++)
			{
				if(v[i] <= mid)continue;
				int tmp = (v[i]/(mid+1));
				tmp++;
				tmp = query(1, 1, m+1, tmp, m+1);
				c += tmp;
			}
			if(c > k) lo = mid+1;
			else
			{
				ans = mid;
				hi = mid-1;
			}
		}
		int cost=0;
		for(int i=0;i<=(n/2);i++)
		{
			cost += query(1, 1, m+1, v[i]+1, m+1);
		}
		if(cost<=k)ans = 0;
		cout << ans << "\n";
	}	

	signed main()
	{
		int t = 1;
		cin >> t;
		for(int i=1;i<=t;i++)
		{
			solve(i);
		}
		return 0;
	}