#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

int st[MAX_N];

int main()
{
    int l,m,n;
    cin >> l >> m >> n;
    rep(i,l){
        int a;
        scanf("%d",&a);
        st[a]++;
    }
    vector<int> vec(m);
    rep(i,m){
        scanf("%d",&vec[i]);
    }
    sort(all(vec));
    vec.erase(unique(all(vec)),vec.end());
    int q;
    cin >> q;
    rep(i,q){
        int ans = 0;
        rep(j,vec.size()){
            if(vec[j]+i<=n){
                ans += st[vec[j]+i];
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}