#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
// #define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
typedef unsigned int ull;
const int M = (1e5/32)+1;
vector<ull> a(M,0);
vector<ull> b(M,0);
ull tt=1;
void foo3(){
    bool f=false;
    bool f1;
    reep(i,0,b.size()){
        if(b[i]>=(tt<<31)) f1=true;
        else f1=false;
        b[i]<<=tt;
        if(f) b[i]++;
        f=f1;
    }
}
int foo2(){
    int ret=0;
    rep(i,a.size()){
    	// cout<<__builtin_popcount(a[i]&b[i])<<endl;
        ret+=__builtin_popcount(a[i]&b[i]);
    }
    return ret;
}
void foo(vector<ull> &v,int t){
    int t1=t/32;
    int t2=t%32;
    // cout<<t<<" "<<t1<<" "<<t2<<endl;
    v[t1]=v[t1]|(tt<<t2);
}
void mainmain(){
    int l;
    cin>>l;
    int m;
    cin>>m;
    int n;
    cin>>n;
    rep(i,l){
        int t;
        cin>>t;
        foo(a,t);
    }
    rep(i,m){
        int t;
        cin>>t;
        foo(b,t);
    }
    int Q;
    cin>>Q;
    // cout<<b[0]<<endl;
    // cout<<b[1]<<endl;
    // cout<<b[2]<<endl;
    // cout<<b[3]<<endl;
    rep(i,Q){
        cout<<foo2()<<endl;
        foo3();
        // cout<<b[0]<<endl;
	    // cout<<b[1]<<endl;
    }
    // cout<<Q<<endl;
    
    // cout<<b[2]<<endl;
    // cout<<b[3]<<endl;
}


signed main() {
    mainmain();
}