#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 64, M = 10005, mod = 998244353; 
int n, m, a[N][N], ans[N][M]; 
struct mat {
	int a[N][N]; 
	void clr () { for (int i = 0;i < n;i++) memset(a[i], 0, n<<2); }
	void init () {
		clr(); 
		for (int i = 0;i < n;i++) a[i][i] = 1; 
	}
	friend mat operator * (const mat & a, const mat & b) {
		mat c; c.clr(); 
		for (int i = 0;i < n;i++) {
			for (int j = 0;j < n;j++) {
				for (int z = 0;z < n;z++) (c.a[i][j] += (1ll*a.a[i][z]*b.a[z][j]%mod)) %= mod; 
			}
		}
		return c; 
	}
};

void solve () {
	cin >> n >> m; 
	for (int i = 0;i < n;i++) for (int j = 0;j < n;j++) cin >> a[i][j]; 
	int V = 0;
	for (int i = n-1;i >= 0;i--) {
		vector <int> td; 
		for (int j = 0;j < n;j++) {
			if ((i&j) == i) td.pb(j); 
		}
		mat d; d.clr(); 
		for (int j = 0;j < n;j++) {
			for (int z = 0;z < n;z++) d.a[j][z] = a[j][z];  
		}
		mat res; res.init(); 
		for (int j = 1;j <= m;j++) {
			res = res*d; 
			for (int x : td) {
				for (int y : td) (ans[i][j] += res.a[x][y]) %= mod;  
			}
			for (int x : td) (res.a[x][x] += ans[i][j]) %= mod; 
		}
		for (int j = i+1;j < n;j++) {
			if ((j&i)^i) continue; 
			for (int z = 1;z <= m;z++) {
				int o = __builtin_popcount(j^i); 
				if (o&1) ans[i][z] -= ans[j][z]; else ans[i][z] += ans[j][z]; 
				ans[i][z] %= mod; 
			}
		}
		for (int z = 1;z <= m;z++) {
			ans[i][z] = (ans[i][z]+mod)%mod; 
//			cout << i << " " << z << " " << ans[i][z] << endl; 
			V ^= ans[i][z]; 
		}
	}
	cout << V; 
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T = 1;
	while (T--) solve();
	return 0;
}