#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int memo[200100];
int L,M,N;
int ans[100100];
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> L >> M >> N;
  vector <int> A(L);  
  vector <int> B(M);  
  rep(i,L){
    cin >> A[i];
  }
  rep(i,M){
    cin >> B[i];
  }
  sort(ALL(A));
  sort(ALL(B));
  mem(memo,-1);
  rep(i,M){
    memo[B[i]] = B[i];
    memo[B[i]+N+1] = -B[i];
  }
  deque <int> que;
  int ap = 0;
  //DEBUG1(A);
  //DEBUG1(B);
  rep(i,2*N+10){
    if (memo[i] != -1) {
      if (memo[i] > 0) {
        que.push_back(i);
      }else{
        que.pop_front();
      }
    }
    //DEBUG1(que);
    if (A[ap] == i) {
      for (auto &x : que) {
        ans[i-x] += 1;
      }
      ap += 1;
      if (ap == sz(A)) {
        break;
      }
    }
  }

  //output
  int Q;
  cin >> Q;
  rep(i,Q){
    cout << ans[i] << endl;
  }
  return 0;
}