#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;
typedef vector<complex<double>> poly;
const double pi=acos(-1);

poly dft(poly f,int rev){
    int n=f.size();
   int j=0;
   REP(i,1,n-1){
       for(int k=n/2;k>(j^=k);k>>=1);
       if(i<j)swap(f[i],f[j]);
   }
   for(int i=1;i<n;i<<=1){
       complex<double>zeta=polar(1.0,pi/i*rev);
       for(int j=0;j<n;j+=2*i){
           complex<double> ret=1;
           rep(k,i){
               complex<double> s=f[j+k];
               complex<double> t=f[j+k+i];
               f[j+k]=s+t*ret;
               f[j+k+i]=s-t*ret;
               ret*=zeta;
           }
       }
   }
   if(rev==-1)rep(i,n)f[i]/=n;
   return f;
}

poly fft(poly g,poly h){
   poly f;
   int m=(int)g.size()+h.size()+1;
   int sz=1;
   while(sz<m)sz*=2;
   f.resize(sz,0);
   g.resize(sz,0);
   h.resize(sz,0);
   g=dft(g,1);
   h=dft(h,1);
   rep(i,sz)f[i]=g[i]*h[i];
   f=dft(f,-1);
   return f;
}
int main(){
    int l,m,n;
    cin>>l>>m>>n;
    poly a,b;
    a.resize(n+1);
    b.resize(n+1);
    int x;
    rep(i,l){
        scanf("%d",&x);
        a[x]=1;

    }
    rep(i,m){
        scanf("%d",&x);
        b[n-x]=1;

    }
    poly c=fft(a,b);
    int q;cin>>q;
    rep(i,q)printf("%d\n",(int)(c[n+i].real()+0.5));
}