#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 <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; }


////////////////////////////////////////////////////////////////////////////////
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 = 998244353U;
constexpr unsigned MO2 = 2U * MO;
constexpr int FFT_MAX = 23;
using Mint = ModInt<MO>;
constexpr Mint FFT_ROOTS[FFT_MAX + 1] = {1U, 998244352U, 911660635U, 372528824U, 929031873U, 452798380U, 922799308U, 781712469U, 476477967U, 166035806U, 258648936U, 584193783U, 63912897U, 350007156U, 666702199U, 968855178U, 629671588U, 24514907U, 996173970U, 363395222U, 565042129U, 733596141U, 267099868U, 15311432U};
constexpr Mint INV_FFT_ROOTS[FFT_MAX + 1] = {1U, 998244352U, 86583718U, 509520358U, 337190230U, 87557064U, 609441965U, 135236158U, 304459705U, 685443576U, 381598368U, 335559352U, 129292727U, 358024708U, 814576206U, 708402881U, 283043518U, 3707709U, 121392023U, 704923114U, 950391366U, 428961804U, 382752275U, 469870224U};
constexpr Mint FFT_RATIOS[FFT_MAX] = {911660635U, 509520358U, 369330050U, 332049552U, 983190778U, 123842337U, 238493703U, 975955924U, 603855026U, 856644456U, 131300601U, 842657263U, 730768835U, 942482514U, 806263778U, 151565301U, 510815449U, 503497456U, 743006876U, 741047443U, 56250497U, 867605899U};
constexpr Mint INV_FFT_RATIOS[FFT_MAX] = {86583718U, 372528824U, 373294451U, 645684063U, 112220581U, 692852209U, 155456985U, 797128860U, 90816748U, 860285882U, 927414960U, 354738543U, 109331171U, 293255632U, 535113200U, 308540755U, 121186627U, 608385704U, 438932459U, 359477183U, 824071951U, 103369235U};

// as[rev(i)] <- \sum_j \zeta^(ij) as[j]
void fft(Mint *as, int n) {
  assert(!(n & (n - 1))); assert(1 <= n); assert(n <= 1 << FFT_MAX);
  int m = n;
  if (m >>= 1) {
    for (int i = 0; i < m; ++i) {
      const unsigned x = as[i + m].x;  // < MO
      as[i + m].x = as[i].x + MO - x;  // < 2 MO
      as[i].x += x;  // < 2 MO
    }
  }
  if (m >>= 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + m; ++i) {
        const unsigned x = (prod * as[i + m]).x;  // < MO
        as[i + m].x = as[i].x + MO - x;  // < 3 MO
        as[i].x += x;  // < 3 MO
      }
      prod *= FFT_RATIOS[__builtin_ctz(++h)];
    }
  }
  for (; m; ) {
    if (m >>= 1) {
      Mint prod = 1U;
      for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
        for (int i = i0; i < i0 + m; ++i) {
          const unsigned x = (prod * as[i + m]).x;  // < MO
          as[i + m].x = as[i].x + MO - x;  // < 4 MO
          as[i].x += x;  // < 4 MO
        }
        prod *= FFT_RATIOS[__builtin_ctz(++h)];
      }
    }
    if (m >>= 1) {
      Mint prod = 1U;
      for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
        for (int i = i0; i < i0 + m; ++i) {
          const unsigned x = (prod * as[i + m]).x;  // < MO
          as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
          as[i + m].x = as[i].x + MO - x;  // < 3 MO
          as[i].x += x;  // < 3 MO
        }
        prod *= FFT_RATIOS[__builtin_ctz(++h)];
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
    as[i].x = (as[i].x >= MO) ? (as[i].x - MO) : as[i].x;  // < MO
  }
}

// as[i] <- (1/n) \sum_j \zeta^(-ij) as[rev(j)]
void invFft(Mint *as, int n) {
  assert(!(n & (n - 1))); assert(1 <= n); assert(n <= 1 << FFT_MAX);
  int m = 1;
  if (m < n >> 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + m; ++i) {
        const unsigned long long y = as[i].x + MO - as[i + m].x;  // < 2 MO
        as[i].x += as[i + m].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      prod *= INV_FFT_RATIOS[__builtin_ctz(++h)];
    }
    m <<= 1;
  }
  for (; m < n >> 1; m <<= 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + (m >> 1); ++i) {
        const unsigned long long y = as[i].x + MO2 - as[i + m].x;  // < 4 MO
        as[i].x += as[i + m].x;  // < 4 MO
        as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      for (int i = i0 + (m >> 1); i < i0 + m; ++i) {
        const unsigned long long y = as[i].x + MO - as[i + m].x;  // < 2 MO
        as[i].x += as[i + m].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      prod *= INV_FFT_RATIOS[__builtin_ctz(++h)];
    }
  }
  if (m < n) {
    for (int i = 0; i < m; ++i) {
      const unsigned y = as[i].x + MO2 - as[i + m].x;  // < 4 MO
      as[i].x += as[i + m].x;  // < 4 MO
      as[i + m].x = y;  // < 4 MO
    }
  }
  const Mint invN = Mint(n).inv();
  for (int i = 0; i < n; ++i) {
    as[i] *= invN;
  }
}

void fft(vector<Mint> &as) {
  fft(as.data(), as.size());
}
void invFft(vector<Mint> &as) {
  invFft(as.data(), as.size());
}

vector<Mint> convolve(vector<Mint> as, vector<Mint> bs) {
  if (as.empty() || bs.empty()) return {};
  const int len = as.size() + bs.size() - 1;
  int n = 1;
  for (; n < len; n <<= 1) {}
  as.resize(n); fft(as);
  bs.resize(n); fft(bs);
  for (int i = 0; i < n; ++i) as[i] *= bs[i];
  invFft(as);
  as.resize(len);
  return as;
}
vector<Mint> square(vector<Mint> as) {
  if (as.empty()) return {};
  const int len = as.size() + as.size() - 1;
  int n = 1;
  for (; n < len; n <<= 1) {}
  as.resize(n); fft(as);
  for (int i = 0; i < n; ++i) as[i] *= as[i];
  invFft(as);
  as.resize(len);
  return as;
}
////////////////////////////////////////////////////////////////////////////////

/*
  N >>= E;
  N = 7:
        b-a     c-b     d-c c-d     b-c     a-b       
  [  a   ][  b   ][  c   ][d ][  c   ][  b   ][  a   ]
  [ a+d  ][ a+c  ][ b+c  ][2b][ b+c  ][ a+c  ][ a+d  ]
        c-d     b-a     b-c c-b     a-b     d-c       
  
  d[i] := a[i] - a[i-1]
  2^k S = N a[0] + (N-1) d[1] + ... + 1 d[N-1]
  a[X] = a[0] + d[1] + ... + d[X]
       = 2^k S / N + (1/N) d[1] + ... + (X/N) d[X]
                   + ((X+1)/N - 1) d[X+1] + ... + ((N-1)/N - 1) d[N-1]
*/

int N, X;
Int Ans;

#ifdef LOCAL
constexpr int SMALL=100;
Mint brt[SMALL];
#endif

int E;
Mint small[40];
Mint invTwoHead, invN, S;
int fsLen;
vector<Mint> fs;

constexpr int LIM_TWO = 1 << 16;
Mint baby[LIM_TWO + 1], giant[LIM_TWO];
void prepareInvTwo() {
  baby[0] = 1;
  baby[1] = Mint(2).inv();
  for (int i = 2; i <= LIM_TWO; ++i) baby[i] = baby[i - 1] * baby[1];
  giant[0] = 1;
  for (int i = 1; i < LIM_TWO; ++i) giant[i] = giant[i - 1] * baby[LIM_TWO];
}
Mint invTwo(Int e) {
  e %= (MO - 1);
  return baby[e & (LIM_TWO - 1)] * giant[e >> 16];
}

void Init(int X_, const vector<int> &A_) {
  prepareInvTwo();
  
  N = (int)A_.size() - 1;
  X = X_ - 1;
  vector<Mint> A(N);
  for (int i = 0; i < N; ++i) {
    A[i] = A_[i + 1];
  }
  Ans = 0;
// cerr<<"N = "<<N<<", X = "<<X<<", A = "<<A<<endl;
  
#ifdef LOCAL
auto as=A;
for(int k=0;k<SMALL;++k){
 brt[k]=as[X];
 vector<Mint>aas(N);
 for(int i=0;i<N;++i)aas[i]=(as[i/2]+as[N-1-i/2])/2;
 as=aas;
}
#endif
  
  E = __builtin_ctz(N);
  for (int e = 0; e < E + 1; ++e) {
    small[e] = A[X];
    vector<Mint> AA(N);
    for (int i = 0; i < N; ++i) {
      AA[i] = A[i / 2] + A[N - 1 - i / 2];
    }
    A = AA;
  }
// cerr<<"E+1 = "<<E+1<<", A = "<<A<<endl;
  N >>= E;
  X >>= (E + 1);
// cerr<<"N = "<<N<<", X = "<<X<<endl;
  
  invTwoHead = Mint(1 << (E + 1)).inv();
  invN = Mint(N).inv();
  S = 0;
  for (int i = 0; i < N; ++i) {
    S += A[i << E];
  }
  vector<Mint> coef(N, 0);
  for (int i = 1; i <= X; ++i) coef[i] = i * invN;
  for (int i = X + 1; i < N; ++i) coef[i] = i * invN - 1;
  vector<Mint> diffs(N, 0);
  for (int i = 1; i <= (N - 1) / 2; ++i) {
    diffs[i] = A[i << (E + 1)] - A[(i - 1) << (E + 1)];
    diffs[N - i] = -diffs[i];
  }
// cerr<<"coef = "<<coef<<", diffs = "<<diffs<<endl;
  
  vector<vector<Mint>> gss;
  vector<int> vis(N, 0);
  for (int u = 1; u < N; ++u) if (!vis[u]) {
    vector<int> cyc;
    for (int v = u; !vis[v]; v = (2 * v) % N) {
      vis[v] = 1;
      cyc.push_back(v);
    }
    const int len = cyc.size();
// cerr<<"cyc = "<<cyc<<endl;
    vector<Mint> cs(len), ds(len);
    for (int j = 0; j < len; ++j) {
      cs[j] = coef[cyc[j]];
      ds[j] = diffs[cyc[len - 1 - j]];
    }
    const auto prod = convolve(cs, ds);
    vector<Mint> gs(len, 0);
    for (int i = 0; i < (int)prod.size(); ++i) gs[(i + 1) % len] += prod[i];
    gss.push_back(gs);
  }
  sort(gss.begin(), gss.end(), [&](const vector<Mint> &gs0, const vector<Mint> &gs1) -> bool {
    return (gs0.size() > gs1.size());
  });
  fsLen = (!gss.empty()) ? gss[0].size() : 1;
  fs.assign(fsLen, 0);
  for (int j = 0, k = 0; j < (int)gss.size(); j = k) {
    const int len = gss[j].size();
    assert(fsLen % len == 0);
    vector<Mint> sum(len, 0);
    for (k = j; k < (int)gss.size() && gss[j].size() == gss[k].size(); ++k) {
      for (int l = 0; l < len; ++l) {
        sum[l] += gss[k][l];
      }
    }
    for (int l = 0; l < fsLen; ++l) {
      fs[l] += sum[l % len];
    }
  }
}
void Query(Int id, Int K) {
  Mint ans = 0;
  if (K < E + 1) {
    ans = invTwo(K) * small[K];
  } else {
    ans += invTwoHead * S * invN;
    ans += invTwo(K) * fs[(K - (E + 1)) % fsLen];
  }
  Ans ^= (Int)ans.x * id;
// cerr<<"Query "<<K<<" = "<<ans<<endl;
#ifdef LOCAL
if(K<SMALL){
 if(brt[K]!=ans){
  cerr<<"Query "<<K<<": "<<brt[K]<<" "<<ans<<endl;
  assert(false);
 }
}
#endif
}
void Output() {
  printf("%lld\n", Ans);
}


unsigned long long rd (unsigned long long &x) {
x ^= (x << 13);
x ^= (x >> 7);
x ^= (x << 17);
return x;
}

int main () {
int test, T;
unsigned long long seed;
scanf("%d%d%llu", &test, &T, &seed);
for (int Case = 1; Case <= T; Case ++) {
int n, q, x;
long long k_max;
scanf("%d%d%d%lld", &n, &q, &x, &k_max);
vector<int> a(n + 1);
for (int i = 1; i <= n; i ++) {
scanf("%d", &a[i]);
}

Init(x, a);

for (int i = 1; i <= q; i ++) {
long long k = rd(seed) % k_max;
/*
Code your solution here.
*/

Query(i, k);

}

Output();

}
}