#include<bits/stdc++.h>
#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 ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 1 << 20, B = 288; 
int n, q, op[N], l[N], r[N];
int a[N];
int cov[N];

pair < int, int > ad[N];
int all;
void solve(int L, int R, vi q) {
	if(L == R) {
		if(op[L] == 2) {
			cout << a[l[L]] << '\n';
		} else {
			R(i, sz(q) - 1, 0) 
				if(l[L] <= q[i] && q[i] < r[L]) 
					a[q[i] + 1] ^= a[q[i]];
		}
		return ;
	}
	
	int G = (R - L + 2) >> 1, mid = (L + R) >> 1;
	L(t, L, R) {
		int S = t - L + 1;
		L(i, max(l[t] - S, 1), l[t]) cov[i] = true;
		L(i, max(r[t] - S, 1), r[t]) cov[i] = true;
	}
	
	vi b, t(sz(q));
	L(i, 0, sz(q) - 1) 
		if(cov[q[i]]) b.emplace_back(q[i]), t[i] = -1;
		else t[i] = a[q[i]], a[q[i]] = 0;
	
	vi st, imp;
	L(t, L, R) {
		st.emplace_back(l[t]);
		if(r[t]) st.emplace_back(r[t]);	
	} 
	
	sort(st.begin(), st.end());
	
	int ri = 0;
	for(auto u : st) {
		int l = max(u + 1, ri + 1);
		ri = min(u + G, n);
		L(i, l, ri) if(!cov[i]) imp.emplace_back(i);
	}
	
	vi T(sz(imp));
	
	L(t, L, R) {
		int S = t - L + 1;
		L(i, max(l[t] - S, 1), min(l[t] + S, n)) cov[i] = false;
		if(r[t]) L(i, max(r[t] - S, 1), min(r[t] + S, n)) cov[i] = false;
	}
	
	solve(L, mid, b);
	
	L(i, 0, sz(imp) - 1) T[i] = a[imp[i]], a[imp[i]] = 0;
	
	solve(mid + 1, R, b);
	
	// ------------------------------
	all = 0;
	L(i, mid + 1, R) 
		if(op[i] == 1) {
			++all, ad[all].first = l[i], ad[all].second = 1;
			++all, ad[all].first = r[i] + 1, ad[all].second = -1;
		}
	sort(ad + 1, ad + all + 1);
	int pos = 1, s = 0;
	L(i, 0, sz(imp) - 1) if(T[i]) {
		int u = imp[i];
		while(pos <= all && ad[pos].first <= u) s += ad[pos].second, ++pos;
		for(int g = s; g; g = (g - 1) & s) a[u + g] ^= T[i];
		a[u] ^= T[i];
	}
	
	// -------------------------------------
	
	all = 0;
	L(i, L, R) 
		if(op[i] == 1) {
			++all, ad[all].first = l[i], ad[all].second = 1;
			++all, ad[all].first = r[i] + 1, ad[all].second = -1;
		}
	sort(ad + 1, ad + all + 1);
	
	pos = 1, s = 0;
	L(i, 0, sz(t) - 1) if(t[i] > 0) {
		int u = q[i];
		while(pos <= all && ad[pos].first <= u) s += ad[pos].second, ++pos;
		for(int g = s; g; g = (g - 1) & s) a[u + g] ^= t[i];
		a[u] ^= t[i];
	}
}
int main () {
//	return system("fc qwq.out a.out"), 0;
//	freopen("a.in", "r", stdin);
//	freopen("qwq.out", "w", stdout); 
	ios :: sync_with_stdio(false); 
	cin.tie(0); cout.tie(0); 
	int tst;
	cin >> tst;
	cin >> n >> q;
	L(i, 1, n) {
		cin >> a[i];
	}
	L(t, 1, q) {
		cin >> op[t];
		if(op[t] == 2) {
			cin >> l[t];
		} else {
			cin >> l[t] >> r[t];
		}
	}
	for(int L = 1, R; L <= q; L = R + 1) {
		R = min(q, L + B - 1);
		vi p(n);
		L(i, 1, n) p[i - 1] = i; 
		solve(L, R, p);
	}
	L(i, 1, n) cout << a[i] << '\n';
	return 0;
}