#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	int T=0; cin>>T;
	while (T--)
	{
		int n,m,q,i,j;
		cin>>n>>m>>q; ++m;
		vector<int> b(n),a(m+1); a[m]=2e9;
		vector<int> c(n);
		for (int &x:b) cin>>x;
		for (i=1; i<m; i++) cin>>a[i];
		int l=0,r=m,mid;
		a[1]=0;
		for (i=m; i; i--) a[i-1]=min(a[i-1],a[i]);
		for (i=1; i<=m; i++) for (j=1; i*j<=m; j++) a[i*j]=min(a[i*j],a[i]+a[j]);
		for (i=m; i; i--) a[i-1]=min(a[i-1],a[i]);
		while (l<r)
		{
			mid=l+r>>1;
			auto check=[&](int l)
				{
					for (int i=0; i<n; i++)
					{
						// cerr<<(b[i]+1+l)<<' '<<(l+1)<<' '<<(b[i]+1+l)/(l+1)<<endl;
						c[i]=a[(b[i]+1+l)/(l+1)];
					}
					sort(all(c));
					return accumulate(c.begin(),c.begin()+(n+1>>1),0ll)<=q;
				};
			if (check(mid)) r=mid; else l=mid+1;
		}
		cout<<l<<'\n';
	}
}