import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int L, M, N;
int[] A, B;
int Q;

void main() {
  try {
    for (; ; ) {
      L = readInt();
      M = readInt();
      N = readInt();
      A = new int[L];
      foreach (i; 0 .. L) {
        A[i] = readInt();
      }
      B = new int[M];
      foreach (i; 0 .. M) {
        B[i] = readInt();
      }
      Q = readInt();
      
      int n;
      for (n = 1; n < 4 * N; n <<= 1) {}
      auto fft = new Fft(n);
      
      auto a = new real[n];
      auto b = new real[n];
      a[] = 0.0;
      b[] = 0.0;
      foreach (i; 0 .. L) {
        a[A[i]] += 1.0;
      }
      foreach (i; 0 .. M) {
        b[N - B[i]] += 1.0;
      }
      const fa = fft.fft!real(a);
      const fb = fft.fft!real(b);
      auto fc = new Complex!real[n];
      foreach (j; 0 .. n) {
        fc[j] = fa[j] * fb[j];
      }
      const c = fft.inverseFft!real(fc);
      debug {
        writeln(c[0 .. min($, 16)]);
      }
      
      foreach (q; 0 .. Q) {
        writeln(cast(int)(round(c[N + q].re)));
      }
    }
  } catch (EOFException e) {
  }
}