#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

unsigned int a[10000], b[10000];

int main(void) {
    int i, j, l, m, n, q;
    cin >> l >> m >> n;
    rep (i,l) {
        int x;
        cin >> x;
        a[x/32] |= 1 << x % 32;
    }
    rep (i,m) {
        int x;
        cin >> x;
        b[x/32] |= 1 << x % 32;
    }
    cin >> q;
    while (q--) {
        int sum = 0;
        rep (i,l/32+1)
            sum += __builtin_popcount(a[i] & b[i]);
        cout << sum << endl;
        rrep (i,l/32+1) {
            b[i] <<= 1;
            if (i > 0)
                b[i] |= b[i-1] >> 31 & 1;
        }
    }
    return 0;
}