#include <bits/stdc++.h>
#include <immintrin.h>
#pragma GCC target ("avx2")

const int MAXN = 250005;

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

namespace Sub_1 {
	
	int32_t b[MAXN];
	
	inline void Xor (const int32_t l, const int32_t r) {
		int i;
		for (i = r - 15; i > l + 16; i -= 16) {
			_mm512_store_epi32 (a + i, _mm512_xor_epi32 (_mm512_load_epi32 (a + i), _mm512_load_epi32 (a + i - 1)));
		}
		
		// for (i = r - 7; i > l + 8; i -= 8) {
			// _mm256_store_epi32 (a + i, _mm256_xor_epi32 (_mm256_load_epi32 (a + i), _mm256_load_epi32 (a + i - 1)));
		// }
		
		for (-- i; i > l; -- i) a[i] = a[i] ^ a[i - 1];
		// 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_B {
	
	int32_t val = 0;
	
	const int maxn = 250001;
	
	std::bitset <maxn> p;
	
	inline std::bitset <maxn> Cut (const std::bitset <maxn> b, const int32_t l, const int32_t r) {
		return ((b >> l) << (maxn - (r - l + 1))) >> (maxn - r - 1);
	}
	
	inline void Xor (const int32_t l, const int32_t r) {
		p = p ^ (Cut (p, l, r - 1) << 1);
	}
	
	inline int32_t Que (const int32_t pos) {
		return p[pos] * val;
	}
}

namespace Opt_D {
	
	std::vector <int> D;
	std::vector <int> S;
	
	int b[MAXN];
	
	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 ();
			}
		}
	}
	
	inline void Xor (const int32_t l, const int32_t r) {
		++ cnt;
		
		if (cnt == 1023) {
			for (int i = 1; i <= n; ++ i) b[i] = a[i];
			for (int i = 1; i <= n; ++ i) b[i] = b[i] ^ b[i - 1];
			for (int i = 1; i <= n; ++ i) a[i] = b[i] ^ b[std::max (0, i - 1024)];
			cnt = 0;
		}
		
	}
	
	inline int32_t Que (const int32_t x) {
		int32_t res = 0; Calc (cnt);
		
		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 || T == 7 || T == 8) {
	
		using namespace Sub_1;
	
		for (int i = 1; i <= q; ++ i) {
			std::cin >> opt;
			
			if (opt == 1) std::cin >> l >> r;
			else std::cin >> pos;
			
			if (opt == 1) {
				for (int J = r; J > l; -- J)
					a[J] = a[J] ^ a[J - 1];
			} else std::cout << Que (pos) << '\n';
		}
		
		for (int i = 1; i <= n; ++ i)
			std::cout << a[i] << '\n';
	
	} else if (T == 2 || T == 3) {
		
		using namespace Opt_B;
		
		p = 0;
		
		for (int i = 1; i <= n; ++ i)
			if (a[i]) p[i] = 1, val = std::max (val, a[i]);
		
		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 << Que (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) Xor (l, r);
			if (opt == 2) std::cout << Que (pos) << '\n';
			
		}
		
		if (__builtin_popcount (cnt + 1) == 1) {
			for (int i = 1; i <= n; ++ i) a[i] = a[i] ^ a[i - 1];
			
			for (int i = 1; i <= n; ++ i) 
				std::cout << (a[i] ^ a[std::max (i - cnt - 1, 0)]) << '\n';
			
		} else {
			for (int i = 1; i <= n; ++ i) std::cout << Que (i) << '\n';
		}
	}
	
	return 0;
}