#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fr(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

typedef bitset<200000> BIT;

int L, M, N;
BIT A, B;
int Q;

int main() {
    cin >> L >> M >> N;

    rep (i, L) {
        int a;
        cin >> a;
        A[a] = true;
    }

    rep (i, M) {
        int b;
        cin >> b;
        B[b] = true;
    }

    cin >> Q;

    rep (i, Q) {
        cout << (A & B).count() << endl;
        B <<= 1;
    }
}