#include "math.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ifor(i, a, b) for (int i = (a); i < (b); i++)
#define rfor(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long double ld;
typedef long long int lli;
typedef complex<double> P;
const double eps = 1e-11;
int vex[4] = {1, 0, -1, 0};
int vey[4] = {0, 1, 0, -1};
typedef vector<double> Vec;
typedef vector<int> vec;
typedef vector<Vec> MAT;
typedef vector<vec> mat;
lli MOD = 1000000007;

bitset<200005> A;
bitset<200005> B;
int main()
{
    int l, m, n;
    int a, b;
    cin >> l >> m >> n;
    rep(i, l)
    {
        cin >> a;
        A[a] = 1;
    }
    rep(i, m)
    {
        cin >> a;
        B[a] = 1;
    }
    int q;
    cin >> q;
    rep(i, q)
    {
        cout << (A & (B << i)).count() << endl;
    }
}