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

constexpr int LIM_INV = 400'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}

Mint path(int dx, int dy) {
  return (dx >= 0 && dy >= 0) ? (fac[dx + dy] * invFac[dx] * invFac[dy]) : 0;
}


constexpr int MAX_T = 100'010;
constexpr int MAX_PQ = 10;

int T, C, P, Q, L;
int N[MAX_T], M[MAX_T];
Mint F[MAX_T][MAX_PQ];


namespace expr {
Mint dp[110][110][210];
void run(int n) {
  memset(dp, 0, sizeof(dp));
  dp[0][0][0] = 1;
  for (int x = 0; x <= n; ++x) for (int y = 0; y <= n; ++y) {
    if (y <= x) {
      for (int k = x + y + 1; k >= 1; --k) dp[x][y][k] = dp[x][y][k - 1];
      dp[x][y][0] = 0;
    }
    for (int k = 0; k <= x + y + 1; ++k) dp[x + 1][y][k] += dp[x][y][k];
    for (int k = 0; k <= x + y + 1; ++k) dp[x][y + 1][k] += dp[x][y][k];
  }
  for (int x = 0; x <= n; ++x) {
    Mint g = 0, h = 0;
    for (int k = 0; k <= x + x + 1; ++k) {
      g += dp[x][x][k] * k;
      h += dp[x][x][k] * (x + x + 1 - k);
    }
    cerr << x << ": " << g + h << " " << g << " " << h << "; "; pv(dp[x][x], dp[x][x] + (x + x + 1 + 1));
  }
}
}  // expr


namespace brute {
constexpr int SMALL = 1010;
Mint g[SMALL][SMALL];
Mint dp[MAX_PQ][SMALL][SMALL][2];
vector<Mint> run() {
  memset(dp, 0, sizeof(dp));
  for (int p = 0; p < P; ++p) for (int q = 0; q < Q; ++q) {
    const int id = p * Q + q;
    dp[id][0][0][0] = 1;
    for (int x = 0; x <= L; ++x) for (int y = 0; y <= L + C; ++y) {
      if (y <= x) {
        dp[id][x][y][1] += dp[id][x][y][0] * Mint(x).pow(p) * Mint(y).pow(q);
      }
      dp[id][x + 1][y][0] += dp[id][x][y][0];
      dp[id][x + 1][y][1] += dp[id][x][y][1];
      dp[id][x][y + 1][0] += dp[id][x][y][0];
      dp[id][x][y + 1][1] += dp[id][x][y][1];
    }
// cerr<<"p = "<<p<<", q = "<<q<<endl;
// for(int x=0;x<=L;++x){for(int y=0;y<=L+C;++y)cerr<<dp[id][x][y][0]<<","<<dp[id][x][y][1]<<" ";cerr<<endl;}
  }
  vector<Mint> ans(T, 0);
  for (int t = 0; t < T; ++t) {
    for (int p = 0; p < P; ++p) for (int q = 0; q < Q; ++q) {
      const int id = p * Q + q;
      ans[t] += F[t][id] * dp[id][N[t]][M[t]][1];
    }
  }
  return ans;
}
}  // brute


namespace sub3 {
vector<Mint> run() {
  vector<Mint> gs(L + 1, 0), hs(L + 1, 0);
  for (int n = 0; n <= L; ++n) {
    gs[n] = ((2 * n + 1) * path(n, n) + Mint(4).pow(n)) / 2;
    hs[n] = path(n, n) * (2 * n + 1) - gs[n];
  }
// cerr<<"gs = "<<gs<<endl;
// cerr<<"hs = "<<hs<<endl;
  vector<Mint> ans(T, 0);
  for (int t = 0; t < T; ++t) {
    if (N[t] <= M[t]) {
      Mint sum = 0;
      for (int x = 0; x < N[t]; ++x) {
        // (x, x) -> (x, x+1)
        sum += gs[x] * (path(N[t] - x, M[t] - (x+1)) - path(M[t] - x, N[t] - (x+1)));
      }
      sum += gs[N[t]];
      ans[t] += F[t][0] * sum;
    } else {
      Mint sum = 0;
      for (int y = 0; y < M[t]; ++y) {
        // (y, y) -> (y+1, y)
        sum += hs[y] * (path(N[t] - (y+1), M[t] - y) - path(M[t] - (y+1), N[t] - y));
      }
      sum += hs[M[t]];
      sum = path(N[t], M[t]) * (N[t] + M[t] + 1) - sum;
      ans[t] += F[t][0] * sum;
    }
  }
  return ans;
}
}  // sub3


int main() {
  prepare();
  
  expr::run(10);
  
  for (; ~scanf("%d%d%d%d%d", &T, &C, &P, &Q, &L); ) {
    ++P;
    ++Q;
    for (int t = 0; t < T; ++t) {
      scanf("%d%d", &N[t], &M[t]);
      assert(N[t] + C == M[t]);
      for (int p = 0; p < P; ++p) for (int q = 0; q < Q; ++q) {
        scanf("%u", &F[t][p * Q + q].x);
      }
    }
    
    vector<Mint> ans;
    if (P == 1 && Q == 1) {
      ans = sub3::run();
    } else {
      ans = brute::run();
    }
    for (int t = 0; t < T; ++t) {
      printf("%u\n", ans[t].x);
    }
#ifdef LOCAL
const auto brt=brute::run();
for(int t=0;t<T;++t)if(brt[t]!=ans[t]){
 cerr<<N[t]<<" "<<M[t]<<"; ";pv(F[t],F[t]+P*Q);
 cerr<<"brt = "<<brt<<endl;
 cerr<<"ans = "<<ans<<endl;
}
assert(brt==ans);
#endif
  }
  return 0;
}