#include <bits/stdc++.h>

const int MAXN = 250005;

int32_t a[MAXN], b[MAXN];
int32_t T, n, q;

namespace Sub_1 {
	
	inline void Xor (const int32_t l, const int32_t r) {
		for (int i = r; i > l; -- i) a[i] = a[i] ^ a[i - 1];
	}
	
	inline int32_t Que (const int32_t p) {
		return a[p];
	}

}

namespace Opt_D {
	
	std::vector <int> D;
	std::vector <int> S;
	
	int32_t cnt = 0;
	
	inline void Calc (const int32_t x) {
		D.clear (), D.push_back (0);
		for (int i = 20; i >= 0; -- i) {
			if (x >> i & 1) {
				while (D.size ()) S.push_back (D.back ()), S.push_back (D.back () + (1 << i)), D.pop_back ();
				while (S.size ()) D.push_back (S.back ()), S.pop_back ();
			}
		}
	//	for (auto i : D) std::cerr << i << ' ';
	//	std::cerr << '\n';
	}
	
	int tot = 0;
	
	inline int32_t Que (const int32_t x) {
		int32_t res = 0; Calc (cnt);
		
		++ tot;
		
		if (tot == 49986) std::cerr << x << '\n';
		
		for (auto i : D) 
			if (x - i >= 1) res = res ^ a[x - i];

		return res;
	}
	
}


int32_t opt, l, r, pos;

int main () {
	
	std::ios::sync_with_stdio(0);
	std::cin.tie(0), std::cout.tie(0);
	
	std::cin >> T;
	
	std::cin >> n >> q;
	
	for (int i = 1; i <= n; ++ i) std::cin >> a[i];
	
	if (T == 1) {
	
		using namespace Sub_1;
	
		for (int i = 1; i <= q; ++ i) {
			std::cin >> opt;
			
			if (opt == 1) std::cin >> l >> r;
			if (opt == 2) std::cin >> pos;
			
			if (opt == 1) Xor (l, r);
			if (opt == 2) std::cout << Que (pos) << '\n';
			
			for (int i = 1; i <= n; ++ i)
				std::cout << a[i] << '\n';
			
		}
	
	} else {
		
		using namespace Opt_D;
		
		for (int i = 1; i <= q; ++ i) {
			std::cin >> opt;
			
			if (opt == 1) std::cin >> l >> r;
			if (opt == 2) std::cin >> pos;
			
			if (opt == 1) ++ cnt;
			if (opt == 2) std::cout << Que (pos) << '\n';
		}
		
		for (int i = 1; i <= n; ++ i) b[i] = Que (i);
		
		for (int i = 1; i <= n; ++ i)
			std::cout << b[i] << '\n';
		
	}
	
	return 0;
}