#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=2.1e4+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,T,A[N],B[N],f[N];
pii X[N],Y[N];int Xh,Yh;
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&T);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);for(i=1;i<=n;i++) scanf("%d",&B[i]);
	Me(f,0x3f);for(i=1;i<=n;i++) for(j=i;j<=n;j++) f[A[j]-A[i]]=min(f[A[j]-A[i]],B[i]+B[j]);
	int Mi=1e9+7;for(i=1e5;~i;i--) if(f[i]<=1e8) X[++Xh]=make_pair(i,f[i]),Mi=f[i];
	for(i=1;i<=m;i++) scanf("%d",&A[i]);for(i=1;i<=m;i++) scanf("%d",&B[i]);
	Me(f,0x3f);for(i=1;i<=m;i++) for(j=i;j<=m;j++) f[A[j]-A[i]]=min(f[A[j]-A[i]],B[i]+B[j]);
	Mi=1e9+7;for(i=1e5;~i;i--) if(f[i]<=1e8) Y[++Yh]=make_pair(i,f[i]),Mi=f[i];
	while(T--){
		ll x;scanf("%lld",&x);ll ans=0;
		for(i=1;i<=Xh;i++) for(j=1;j<=Yh;j++) if(1ll*X[i].fi*Y[j].se+1ll*X[i].se*Y[j].fi<=x) ans=max(ans,1ll*X[i].fi*Y[j].fi);
		printf("%lld\n",ans);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}