#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define pll pair<ll,ll>
#define ls d*2
#define rs d*2+1
#define mid (l+r)/2
#define lowbit(x) (x&(-x))
//#define endl "\n"
#define all(x) x.begin(),x.end()
#define int long long
//mt19937 seed;
//uniform_int_distribution<int>num(0,2e9);
const int N=1e6+10;
const int M=33;


int n;
int c[N];
pair<int,int>temp[N];
vector<pair<int,int>>dy,xy;
vector<int>dd;
int tr[N];
bool check(int x){
	for(int i=1;i<=n+1;i++)tr[i]=0;
	int ans=dd.end()-lower_bound(all(dd),x);
	for(int i=0;i<xy.size();i++){
		int t=(x-xy[i].second)/xy[i].first-((x-xy[i].second)%xy[i].first&&(x-xy[i].second)>0?1:0);
		int pos=upper_bound(c+1,c+n+1,t)-c;
		pos--;
		if(pos>xy.size())pos=xy.size();
		if(pos==0)continue;
		tr[pos]++;
	}
	for(int i=0;i<dy.size();i++){
		int t=(x-dy[i].second)/dy[i].first+((x-dy[i].second)%dy[i].first&&x-dy[i].second>0?1:0);
		int pos=lower_bound(c+1,c+1+n,t)-c;
		if(pos<=n-dy.size())pos=n-dy.size()+1;
		if(pos==n+1)continue;
		tr[pos]++;
	}
	for(int i=1;i<=xy.size();i++){
		tr[i]+=tr[i-1];
		tr[i]=min(tr[i],i);
	}
	for(int i=n;i>n-dy.size();i--){
		tr[i]+=tr[i+1];
		tr[i]=min(tr[i],n-i+1);
	}
	//cout<<x<<": "<<ans<<" "<<tr[xy.size()]<<" "<<tr[n-dy.size()+1]<<endl;
	return ans+tr[xy.size()]+tr[n-dy.size()+1]>=(n+1)/2;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int _=1;cin>>_;
    while(_--){
    	cin>>n;
    	for(int i=1;i<=n;i++)cin>>temp[i].first;
    	for(int i=1;i<=n;i++)cin>>temp[i].second;
    	for(int i=1;i<=n;i++)cin>>c[i];
    	sort(c+1,c+1+n);
    	for(int i=1;i<=n;i++){
    		if(temp[i].first>0)dy.push_back(temp[i]);
    		else if(temp[i].first==0)dd.push_back(temp[i].second);
    		else xy.push_back(temp[i]);
		}
		sort(all(dd));
		int l=-2e18,r=2e18;
		while(l+1<r){
			if(check(mid))l=mid;
			else r=mid;
		}
		if(check(r))cout<<r<<endl;
		else cout<<l<<endl;
		dd.clear();
		dy.clear();
		xy.clear();
    }
}