#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 64;
const int M = 2e4;
const int mod = 998244353;
inline int fpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1)
    (b & 1) && (ret = (long long)ret * a % mod), a = (long long)a * a % mod;
  return ret;
}
int n, m;
int a[N][N];
inline int det(int a[N][N]) {
  int temp[N][N];
  int ret = 1;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      temp[i][j] = a[i][j];
  for (int i = 0; i < n; ++i) {
    int num = -1;
    for (int j = i; j < n; ++j)
      if (temp[j][i])
        num = j;
    if (num == -1)
      return 0;
    if (num > i) {
      ret = mod - ret;
      for (int j = 0; j < n; ++j)
        swap(temp[i][j], temp[num][j]);
    }
    int inv = fpow(temp[i][i], mod - 2);
    for (int j = i + 1; j < n; ++j)
      if (temp[j][i])
        for (int k = i, v = (long long)temp[j][i] * inv % mod; k < n; ++k)
          temp[j][k] = (temp[j][k] - (long long)v * temp[i][k] % mod + mod) % mod;
  }
  for (int i = 0; i < n; ++i)
    ret = (long long)ret * temp[i][i] % mod;
  return ret;
}
inline void mul(int a[N][N], int b[N][N], int c[N][N]) {
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      c[i][j] = 0;
  for (int k = 0; k < n; ++k)
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j)
        c[i][j] = (c[i][j] + (long long)a[i][k] * b[k][j]) % mod;
}
int chr[N + 5], temp[N + 5];
int p[N + 5], q[N + 5];
int pw[N][N][N], f[N][N];
int ans[N][M + 5], ans_xor;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      scanf("%d", a[i] + j);
  for (int x = 0, y; x <= n; ++x) {
    for (int i = 0; i < n; ++i)
      a[i][i] = (a[i][i] - x + mod) % mod;
    y = det(a);
    for (int i = 0; i < n; ++i)
      a[i][i] = (a[i][i] + x) % mod;
    temp[0] = 1;
    for (int i = 1; i <= n; ++i)
      temp[i] = 0;
    for (int i = 0; i <= n; ++i)
      if (x ^ i) {
        for (int j = n; j; --j)
          temp[j] = (temp[j - 1] - (long long)i * temp[j] % mod + mod) % mod;
        temp[0] = (mod - (long long)i * temp[0] % mod) % mod;
        y = (long long)y * fpow((x - i + mod) % mod, mod - 2) % mod;
      }
    for (int i = 0; i <= n; ++i)
      chr[i] = (chr[i] + (long long)y * temp[i]) % mod;
  }
  for (int i = 0; i < n; ++i)
    pw[0][i][i] = 1;
  for (int k = 1; k < n; ++k)
    mul(pw[k - 1], a, pw[k]);
  for (int k = 0; k < n; ++k)
    for (int v = 0; v < n; ++v)
      for (int i = 0; i < n; ++i)
        if ((v & i) == v)
          for (int j = 0; j < n; ++j)
            if ((v & j) == v)
              f[v][k] = (f[v][k] + pw[k][i][j]) % mod;
  for (int v = 0, c; v < n; ++v) {
    q[0] = 1;
    for (int i = 1; i <= n; ++i)
      q[i] = chr[n - i];
    for (int i = 0; i < n; ++i) {
      p[i] = 0;
      for (int j = 0; j <= i; ++j)
        p[i] = (p[i] + (long long)f[v][j] * q[i - j]) % mod;
    }
    p[n] = 0, c = f[v][0];
    for (int i = 0, t; i <= n; ++i)
      t = q[i], q[i] = ((c + 1LL) * q[i] - p[i] + mod) % mod, p[i] = t;
    for (int i = 0; i <= n; ++i)
      ans[v][i] = p[i];
    for (int i = 1; i <= m; ++i)
      for (int j = 1; j <= n && j <= i; ++j)
        ans[v][i] = (ans[v][i] - (long long)q[j] * ans[v][i - j] % mod + mod) % mod;
  }
  for (int i = 1; i <= m; ++i)
    for (int k = 0; (1 << k) < n; ++k)
      for (int v = 0; v < n; ++v)
        if (!(v & (1 << k)))
          ans[v][i] = (ans[v][i] - ans[v | (1 << k)][i] + mod) % mod;
  for (int v = 0; v < n; ++v)
    for (int i = 1; i <= m; ++i)
      ans_xor ^= ans[v][i];
  printf("%d\n", ans_xor);
}