#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


void experiment1() {
  for (int n = 1; n <= 8; ++n) {
    vector<Int> all(n + 1, 0);
    vector<vector<Int>> f(n + 1, vector<Int>(n, 0));
    for (int p = 0; p < 1 << n; ++p) {
      const int a = __builtin_popcount(p);
      ++all[a];
      int x = 0, y = a;
      for (int i = 0; i < n; ++i) {
        f[a][i] += ((p >> i & 1) ? x++ : y++);
      }
    }
    for (int a = 0; a <= n; ++a) {
      cerr << n << " " << a << ": " << f[a] << endl;
      assert(all[a] * (n - a) % n == 0);
      assert(f[a][0] == (all[a] * (n - a) / n) * a);
      for (int i = 0; i < n - 1; ++i) {
        assert(f[a][1] - f[a][0] == f[a][i + 1] - f[a][i]);
      }
    }
  }
}
void experiment2() {
  for (int n = 1; n <= 8; ++n) {
    vector<Int> sq(n);
    for (int x = 0; x < n; ++x) {
      sq[x] = x * x;
    }
    vector<Int> all(n + 1, 0);
    vector<vector<Int>> f(n + 1, vector<Int>(n, 0));
    for (int p = 0; p < 1 << n; ++p) {
      const int a = __builtin_popcount(p);
      ++all[a];
      int x = 0, y = a;
      for (int i = 0; i < n; ++i) {
        f[a][i] += ((p >> i & 1) ? sq[x++] : sq[y++]);
      }
    }
    for (int a = 0; a <= n; ++a) {
      vector<Int> ds(n - 1);
      for (int i = 0; i < n - 1; ++i) {
        ds[i] = f[a][i + 1] - f[a][i];
      }
      cerr << n << " " << a << ": " << f[a] << " " << ds << endl;
      assert(all[a] * (n - a) % n == 0);
      assert(f[a][0] == (all[a] * (n - a) / n) * (a * a));
      for (int i = 0; i < n - 2; ++i) {
        assert(ds[1] - ds[0] == ds[i + 1] - ds[i]);
      }
    }
  }
}

int N, M, T;
vector<int> A;
int Q;
vector<int> C;

int main() {
  // experiment1();
  // experiment2();
  
  for (; ~scanf("%d%d%d", &N, &M, &T); ) {
    A.resize(M);
    for (int m = 0; m < M; ++m) {
      scanf("%d", &A[m]);
    }
    scanf("%d", &Q);
    C.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &C[q]);
      --C[q];
    }
    
    Mint p, q, r;
    if (T == 1) {
      p = 0; q = 1; r = 1;
    } else if (T == 2) {
      p = 1; q = 2; r = 1;
    } else {
      assert(false);
    }
    auto f = [&](Mint x) -> Mint {
      return (p * x + q) * x + r;
    };
    
    const Mint inv0 = Mint(N).inv();
    const Mint inv1 = Mint(N - 1).inv();
    /*
      [ 1       1     ]^-1
      [ (N-1)^2 (N-1) ]
    */
    const Mint invDet = (Mint(N - 1) - Mint(N - 1) * Mint(N - 1)).inv();
    const Mint c11 = invDet * Mint(N - 1);
    const Mint c12 = invDet * -1;
    const Mint c21 = invDet * -Mint(N - 1) * Mint(N - 1);;
    const Mint c22 = invDet * 1;
    for (int m = 0; m < M; ++m) {
      const int a = A[m];
      const int b = N - a;
      Mint g0 = inv0 * (a * f(0) + b * f(a));
      Mint g1 = inv0 * (a * (inv1 * ((a-1) * f(1) + b * f(a))) + b * (inv1 * (a * f(0) + (b-1) * f(a+1))));
      Mint g2 = inv0 * (a * f(a-1) + b * f(N-1));
      r = g0;
      g1 -= r;
      g2 -= r;
      p = c11 * g1 + c12 * g2;
      q = c21 * g1 + c22 * g2;
    }
    
    for (int q = 0; q < Q; ++q) {
      const Mint ans = f(C[q]);
      printf("%u\n", ans.x);
    }
  }
  return 0;
}