#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

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

void init(){
  cin >> L >> M >> N;
  A = vi( L );
  for( int i = 0; i < L; ++i )
    cin >> A[ i ], --A[ i ];
  B = vi( M );
  for( int i = 0; i < M; ++i )
    cin >> B[ i ], --B[ i ];
  cin >> Q;
}

vi bit_a;
vi bit_b;

void preprocess(){
  bit_a = bit_b = vi( ( N + 31 ) / 32 );
  for( int i = 0; i < L; ++i )
    bit_a[ A[ i ] / 32 ] |= 1 << A[ i ] % 32;
  for( int i = 0; i < M; ++i )
    bit_b[ B[ i ] / 32 ] |= 1 << B[ i ] % 32;
}

void solve(){
  for( int i = 0; i < Q; ++i ){
    int ans = 0;
    for( int j = 0; j < bit_a.size(); ++j )
      ans += __builtin_popcount( bit_a[ j ] & bit_b[ j ] );
    cout << ans << endl;
    for( int k = bit_b.size() - 1; k >= 0; --k ){
      bit_b[ k ] <<= 1;
      if( k - 1 >= 0 and bit_b[ k - 1 ] & 1 << 31 )
        bit_b[ k ] |= 1 << 0;
    }
  }
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}