#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class t> using vc = vector<t>;
template<class t> using vvc = vc<vc<t>>;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vc<int>;
using vvi = vvc<int>;
using vl = vc<ll>;
using vvl = vvc<ll>;

#define rep(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define irep(i,a,b) for (int i = (int)(a); i > (int)(b); i--)
#define all(a) a.begin(),a.end()
#define print(n) cout << n << '\n'
#define pritn(n) print(n)
#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout," ")); cout<<"\n";}
#define printvv(n,a) {for(auto itr:n) printv(itr,a);}
#define rup(a,b) (a+b-1)/b
#define input(A,N) rep(i,0,N) cin>>A[i]
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)

void FFT(vector<complex<double>> &a,int ni){
    int n = a.size();
    if(n==1) return;
    vector<complex<double>> a1(n/2,0),a2(n/2,0);
    for(int i = 0;i<n/2;i++){
        a1[i] = a[i*2];
        a2[i] = a[i*2+1];
    }
    FFT(a1,ni);FFT(a2,ni);
    for(int i = 0;i<n/2;i++){
        a2[i] *= polar(1.0,ni*2.0*acos(-1)*i/n);
        a[i] = a1[i] + a2[i];
        a[n/2+i] = a1[i] - a2[i];
    }
}

template< typename T >
vector<T> conv(vector<T> a,vector<T> b){
    int m = a.size() + b.size() - 1;
    int n = 1;
    while(n<m) n<<=1;
    vector<complex<double>> na(n,0);
    vector<complex<double>> nb(n,0);
    for(int i = 0;i<(int)a.size();i++) na[i] = a[i];
    for(int i = 0;i<(int)b.size();i++) nb[i] = b[i];
    FFT(na,1);FFT(nb,1);
    rep(i,0,n) na[i] *= nb[i];
    FFT(na,-1);
    rep(i,0,n) na[i] /= n;
    vector<T> ans(n,0);
    for(int i = 0;i<n;i++) ans[i] = (T)(na[i].real()+0.5);
    return ans;
}

int main(){
    cout << fixed << setprecision(15);
    
    int l,m,n;
    cin>>l>>m>>n;
    vi a(n+1,0);
    vi b(n+1,0);
    rep(i,0,l){
        int x;
        cin>>x;
        a[x]++;
    }
    vi c(m);
    input(c,m);
    int q;
    cin>>q;
    rep(i,0,m){
        int x = c[i];
        b[x]++;
        // x += q;
        // if(x<=n) b[x]--;
    }
    reverse(all(b));
    vi ans = conv<int>(a,b);
    rep(i,n,n+q) print(ans[i]);
    
    //printv(ans,int);
    
    
    //system("pause");
    return 0;
}