#include <bits/stdc++.h>
using namespace std;

bool incl(int a, int b) {
	// a includes b
	// CSES - Xor Pyramid
	return (a | b) == a;
}

char* pi = new char[10000000];

int ru() {
	while (!isdigit(*pi)) {
		pi++;
	}
	int x = 0;
	while (isdigit(*pi)) {
		x *= 10;
		x += *pi - '0';
		pi++;
	}
	return x;
}

int main() {
	fread(pi, 10000000, 1, stdin);
//	fread(pi, 10000000, 1, fopen("be2.txt", "r"));
	int N = ru(), K = ru(), Q = ru();
	vector<int> v(N + 1);
	for (int i = 2; i <= N; i++) {
		v[i] = ru();
	}
	vector<int> l(N + 1);
	for (int i = 2; i <= N; i++) {
		l[i] = l[v[i]] + 1;
	}
	while (Q--) {
		vector<int> w(N + 1);
		for (int i = 1; i <= N; i++) {
			w[i] = ru();
		}
		int ans = 0;
		for (int i = 1; i <= N; i++) {
			if (w[i]) {
				ans ^= incl(K - 1 + l[i], K - 1);
			}
		}
		cout << ans << '\n';
	}
	return 0;
}