#include <bits/stdc++.h>
using namespace std;
const int maxn = 250000, B = 511, C = 500;
int a[maxn + 5];
int ed[C + 5][B + 5];
int tg[C + 5];
int bg[C + 5][B + 5];
int bl[maxn + 5];
int lp[C + 5], rp[C + 5];
int t[B + 5];
void rebuild(int id) {
	for (int j = 0; j <= 2; j++)
		if ((tg[id] >> j) & 1)
			for (int i = rp[id]; i >= lp[id]; i--) a[i] ^= a[i - (1 << j)];
	memset(t, 0, sizeof(t));
	for (int i = 1; i <= tg[id]; i++) t[tg[i] - i] = bg[id][i];
	for (int i = 1; i <= B; i <<= 1)
		for (int j = 0; j <= B; j += (i << 1))
			for (int k = 0; k < i; k++) t[j + k] ^= t[i + j + k];
	for (int i = lp[id]; i <= rp[id]; i++) a[i] ^= t[i - lp[id]];
	tg[id] = 0;
}
void upded(int id) {
	memset(t, 0, sizeof(t));
	for (int i = lp[id]; i <= rp[id]; i++) t[rp[id] - i] = a[i];
	for (int i = 1; i <= B; i <<= 1)
		for (int j = 0; j <= B; j += (i << 1))
			for (int k = 0; k < i; k++) t[i + j + k] ^= t[j + k];
	memcpy(ed[id], t, sizeof(t));
}
int main() {
	int n, q;
	scanf("%*d%d%d", &n, &q);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) bl[i] = (i - 1) / B + 1;
	int c = bl[n];
	for (int i = 1; i <= c; i++) {
		lp[i] = (i - 1) * B + 1, rp[i] = min(i * B, n);
		upded(i);
	}
	for (int i = 1; i <= q; i++) {
		int op, x, y;
		scanf("%d%d", &op, &x);
		if (op == 1) {
			scanf("%d", &y);
			int lb = bl[x], rb = bl[y];
			if (lb == rb) {
				rebuild(bl[x]);
				for (int j = y; j > x; j--) a[j] ^= a[j - 1];
				upded(bl[x]);
			} else {
				rebuild(lb), rebuild(rb);
				for (int j = y; j > lp[rb]; j--) a[j] ^= a[j - 1];
				a[lp[rb]] ^= ed[rb - 1][tg[rb - 1]];
				for (int j = rb - 1; j > lb; j--) {
					bg[j][++tg[j]] = ed[j - 1][tg[j - 1]];
					if (tg[j] == B) rebuild(j), upded(j);
				}
				for (int j = rp[lb]; j > x; j--) a[j] ^= a[j - 1];
				upded(lb), upded(rb);
			}
		} else {
			rebuild(bl[x]);
			printf("%d\n", a[x]);
		}
	}
	for (int i = 1; i <= c; i++) rebuild(i);
	for (int i = 1; i <= n; i++) printf("%d\n", a[i]);
}