#include <bits/stdc++.h>
using namespace std;
int INF = (int)1e9;
long long INFINF = (long long)1e18 + 10;
const long double PI = 3.14159265358979323846;
long long powermodm(long long x, long long n, long long mod) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return result;
}
long long GCD(long long, long long);
long long LCM(long long, long long);
long long power(int, int);
long long choose(long long, long long);
int ones(long long);
void extendedEuclid(long long, long long);
long long MMI(long long, long long);
void fastscan(int &);
bool checkithbit(long long, long long);
vector<long long> SegmentTree;
void Build_Segment_Tree(vector<long long> &a, long long idx, long long l,
                        long long r);
long long sum(long long idx, long long sl, long long sr, long long l,
              long long r);
void update(long long idx, long long sl, long long sr, long long value,
            long long id);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  vector<string> a(n), b(m);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (long long j = 0; j < m; j++) {
    cin >> b[j];
  }
  int q;
  cin >> q;
  while (q--) {
    int z;
    cin >> z;
    z--;
    z = z % (n * m);
    for (int i = 0, j = 0, k = 0;; i++, j++, k++) {
      i %= n;
      j %= m;
      if (k == z) {
        cout << a[i] << b[j] << "\n";
        break;
      }
    }
  }
  return 0;
}
bool checkithbit(long long a, long long i) {
  if (a & (1 << i)) {
    return true;
  } else {
    return false;
  }
}
long long GCD(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
  return (max(a, b) / GCD(a, b)) * min(a, b);
}
long long power(int a, int n) {
  unsigned long long int result = 1, x = a;
  while (n > 0) {
    if (n % 2 == 1) result = result * x;
    x = x * x;
    n = n / 2;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
int ones(long long n) {
  int c = 0;
  while (n) {
    n = n & (n - 1);
    c++;
  }
  return c;
}
long long d, x, y;
void extendedEuclid(long long A, long long B) {
  if (B == 0) {
    d = A;
    x = 1;
    y = 0;
  } else {
    extendedEuclid(B, A % B);
    int temp = x;
    x = y;
    y = temp - (A / B) * y;
  }
}
long long MMI(long long a, long long p) {
  extendedEuclid(a, p);
  if (d == 1 && p != 1)
    return ((x % p) + p) % p;
  else
    return -1;
}
void fastscan(int &number) {
  bool negative = false;
  register int c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
void Build_Segment_Tree(vector<long long> &a, long long idx, long long l,
                        long long r) {
  if (l == r) {
    SegmentTree[idx] = a[l];
  } else {
    long long mid = (l + r) / 2ll;
    Build_Segment_Tree(a, (2ll * idx), l, mid);
    Build_Segment_Tree(a, (2ll * idx) + 1, mid + 1, r);
    SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
  }
}
long long sum(long long idx, long long sl, long long sr, long long l,
              long long r) {
  if (l > r) {
    return 0;
  }
  if (sl == l && sr == r) {
    return SegmentTree[idx];
  }
  long long mid = (sl + sr) / 2;
  return sum(2ll * idx, sl, mid, l, min(r, mid)) +
         sum(2ll * idx + 1, mid + 1, sr, max(mid + 1, l), r);
}
void update(long long idx, long long sl, long long sr, long long value,
            long long id) {
  if (sl == sr && sl == id) {
    SegmentTree[idx] = value;
  } else {
    long long mid = (sl + sr) / 2ll;
    if (id <= mid) {
      update(2ll * idx, sl, mid, value, id);
    } else {
      update(2ll * idx + 1, mid + 1, sr, value, id);
    }
    SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
  }
}
