#include <bits/stdc++.h>
#define L(i) t[i].l
#define R(i) t[i].r
#define fac(i) t[i].fac
#define int long long
using namespace std;

const int N = 1000005;
int n, K, q, l, r, ans;

struct mat {
	int m[5][5];
	void clear() { memset(m, 0, sizeof(m)); }
	int* operator[] (int p) { return m[p]; }
};
mat operator* (mat a, mat b) {
	mat res;
	res.clear();
	for (int k = 1; k <= K; k++) {
		for (int i = 1; i <= K; i++) {
			for (int j = 1; j <= K; j++) {
				res[i][j] = (res[i][j] + 1ll * a[i][k] * b[k][j]) % 1145141;
			}
		}
	}
	return res;
}
struct Seg {
	mat fac;
	int l, r;
} t[N << 2];

mat a[N];

void read(int &a) {
	int x = 0, f = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	a = x * f;
}
void build(int p, int l, int r) {
	L(p) = l;
	R(p) = r;
	if (l == r) {
		fac(p) = a[l];
		return;
	}
	int mid = l + r >> 1;
	build(p * 2, l, mid);
	build(p * 2 + 1, mid + 1, r);
	fac(p) = fac(p * 2) * fac(p * 2 + 1);
}
mat query(int p, int l, int r) {
	if (l <= L(p) && r >= R(p)) return fac(p);
	int mid = L(p) + R(p) >> 1;
	if (r <= mid) return query(p * 2, l, r);
	if (l > mid) return query(p * 2 + 1, l, r);
	return query(p * 2, l, r) * query(p * 2 + 1, l, r);
}
signed main() {
	read(n);
	read(K);
	read(q);
	cout << n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= K; j++) {
			for (int k = 1; k <= K; k++) {
				read(a[i][j][k]);
			}
		}
	}
	build(1, 1, n);
	for (int i = 1; i <= q; i++) {
		read(l);
		read(r);
		mat res = query(1, l, r);
		for (int i = 1; i <= K; i++) {
			for (int j = 1; j <= K; j++) {
				ans ^= res[i][j];
			}
		}
	}
	cout << ans;
	return 0;
}

非常奇怪