#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 1e5+5;
int A[MAXN];
int B[MAXN];
bitset<64> ba[2000], bb[2000];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int L, M, N;
    cin >> L >> M >> N;
    for (int i = 0; i < L; i++) {
        cin >> A[i];
        ba[A[i]/64].set(A[i]%64);
    }
    for (int i = 0; i < M; i++) {
        cin >> B[i];
        bb[B[i]/64].set(B[i]%64);
    }
    int Q;
    cin >> Q;
    while (Q--) {
        int ans = 0;
        for (int i = 0; i < 2000; i++) {
            ans += (ba[i]&bb[i]).count();
        }
        cout << ans << endl;
        for (int i = 1999; i > 0; i--) {
            bb[i] <<= 1;
            if (bb[i-1].test(63)) bb[i].set(0);
        }
        bb[0] <<= 1;
    }
    return 0;
}