/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 3e5 + 9, B = 4, lB = 2;
int a[N], n, q, L[N], R[N], id[N], b[N], g[N];
int f[N / B][B];
vector<int> G[N];
inline void build(int x)
{
	int cnt = 0; int siz = G[x].size();
	int pep = 0;
	L(i, 0, B - 1) g[i] = 0;
	L(i, 0, siz - 1) g[pep++] = G[x][i];
	for (int i = 1; i < B; i <<= 1)
		for (int j = 0; j < B; j += i * 2)
			for (int k = 0; k < i; k++)
				g[i + j] ^= g[i + j + k];
	L(i, L[x], R[x]) b[++cnt] = a[i];
	L(i, 0, lB - 1)
		if(siz & (1 << i))
			R(j, cnt, (1 << i)) b[j] ^= b[j - (1 << i)];
	L(i, 1, cnt) a[L[x] + i - 1] = b[i];
	L(i, L[x], R[x]) a[i] ^= g[i - L[x]];
	L(i, L[x], R[x]) f[x][R[x] - i] = a[i];
	for (int i = 1; i < B; i <<= 1)
		for (int j = 0; j < B; j += i * 2)
			for (int k = 0; k < i; k++)
				f[x][i + j + k] ^= f[x][j + k];
	G[x].clear();
	return ;
}
inline void update(int l, int r)
{
	if(id[l] == id[r])
	{
		build(id[l]);
		R(i, r, l + 1) a[i] ^= a[i - 1];
		build(id[l]); return ;
	}
	int nw = 0;
	build(id[l]);
	nw = a[R[id[l]]];
	R(i, R[id[l]], l + 1) a[i] ^= a[i - 1];
	build(id[l]);
	L(i, id[l] + 1, id[r] - 1)
	{
		if(G[i].size() >= B - 1) build(i);
		int siz = G[i].size();
		int tmp = f[i][siz];
		G[i].pb(nw);
		nw = tmp;
	}
	build(id[r]);
	R(i, r, L[id[r]] + 1) a[i] ^= a[i - 1];
	a[L[id[r]]] ^= nw;
	build(id[r]);
	return ;
}
signed main()
{
	int TC = read();
	n = read(), q = read(); int nn = n;
	L(i, 1, n) a[i] = read();
	while(n % B != 0) a[++n] = 0;
	L(i, 1, n) id[i] = (i - 1) / B + 1;
	L(i, 1, n / B) L[i] = (i - 1) * B + 1, R[i] = i * B;
	L(i, 1, id[n]) build(i);
	L(i, 1, q)
	{
		int op = read();
		if(op == 1)
		{
			int l = read(), r = read();
			update(l, r);
		}
		else
		{
			int x = read();
			build(id[x]);
			printf("%d\n", a[x]);
		}
	}
	L(i, 1, id[n]) build(i);
	L(i, 1, nn) printf("%d\n", a[i]);
	return 0;
}