#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
string alp="abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

using Complex = complex<double>;
vector<Complex> dft(vector<Complex> A, int N, int sgn = 1) {
    if(N == 1) return A;
 
    vector<Complex> F(N / 2), G(N / 2);
    for(int i=0; i<N/2; i++) {
        F[i] = A[2 * i + 0];
        G[i] = A[2 * i + 1];
    }
 
    F = dft(F, N / 2, sgn);
    G = dft(G, N / 2, sgn);
 
    Complex zeta(cos(2.0 * M_PI / N), sin(2.0 * M_PI / N) * sgn);
    Complex pow_zeta = 1;
 
    for(int i=0; i<N; i++) {
        A[i] = F[i % (N / 2)] + pow_zeta * G[i % (N / 2)];
        pow_zeta *= zeta;
    }
    return A;
}
 
vector<Complex> inv_dft(vector<Complex> A, int N) {
    A = dft(A, N, -1);
    for(int i=0; i<N; i++) {
        A[i] /= N;
    }
    return A;
}
 
vector<Complex> multiply(vector<Complex> A, vector<Complex> B) {
    int sz = A.size() + B.size() + 1;
    int N = 1; while(N < sz) N *= 2;
 
    A.resize(N), B.resize(N);
    A = dft(A, N);
    B = dft(B, N);
 
    vector<Complex> F(N);
    for(int i=0; i<N; i++) {
        F[i] = A[i] * B[i];
    }
    return inv_dft(F, N);
}

int main(){fastio
    ll l,m,n;cin>>l>>m>>n;
    ll a[l],b[m];
    ll q;
    rep(i,0,l-1)cin>>a[i];
    rep(i,0,m-1)cin>>b[i];
    cin>>q;
    sort(a,a+l);
    sort(b,b+m,greater<ll>());
    ll c=b[0];
    rep(i,0,m-1){
        b[i]=-b[i]+c;
    }
    vector<Complex> A(n+1),B(n+1);
    rep(i,0,n){
        A[i]=0;
        B[i]=0;
    }
    rep(i,0,l-1){
        A[a[i]]=1;
    }
    rep(i,0,m-1){
        B[b[i]]=1;
    }
    vector<Complex> C;
    C=multiply(A,B);
    rep(v,0,q-1){
        cout<<(ll)(C[v+c].real()+0.5)<<endl;
    }
    
    
    return 0;
}