#include <bits/stdc++.h>
using namespace std;
const int maxn = 25;
unsigned long long n, m, k; int ans = 0;
unsigned long long a[maxn][maxn];
bool vis[maxn][maxn];
void dfs(unsigned int x, unsigned int y, unsigned long long xorans);
int main(void) {
	freopen("xorpath.in", "r", stdin);
	freopen("xorpath.out", "w", stdout);
	cin >> n >> m >> k;
	for (unsigned int i = 1;i <= n;i++) {
		for (unsigned int j = 1;j <= m;j++) {
			cin >> a[i][j];
		}
	}
	dfs(1, 1, a[1][1]);
	cout << ans << '\n';
	return 0;
}
void dfs(unsigned int x, unsigned int y, unsigned long long xorans) {
	if (xorans == k && x == n && y == m) {
		ans++; return;
	}
	if (x > n || y > m) return;
	if (x < 1 || y < 1) return;
	if (vis[x][y]) return;
	vis[x][y] = true;
	dfs(x + 1, y, xorans ^ a[x + 1][y]);
	dfs(x, y + 1, xorans ^ a[x][y + 1]); 
	vis[x][y] = false;
}

时间炸了