#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PI;
const double EPS=1e-9;

const int N = 100010;
int l, m, n;
int a[N], b[N];
int u[2 * N + 1];
int q;
int main(void){
  cin >> l >> m >> n;
  set<int> ss;
  REP(i, 0, l) {
    cin >> a[i];
    ss.insert(a[i]);
    u[a[i]]++;
  }
  REP(i, 0, m) {
    cin >> b[i];
  }
  sort(b, b + m);
  cin >> q;
  REP(v, 0, q) {
    int cnt = 0;
    REP(i, 0, m) {
      if (b[i] + v >= n + 1) {
	break;
      }
      cnt += u[b[i] + v];
    }
    cout << cnt << endl;
  }
}