#include <cstdio>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <cctype>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <cmath>

namespace uvu
{
#define LOCAL ________________DONT_DEFINE_ME_______________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return (iS == iT) ? EOF : *iS++;
#endif
#define getchar ERR
}
void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher() { Flush(); } }iamflusher;
void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
}
template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}
template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x *= -1;
	if(!x) sta[++top] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; putc(sta[top--] ^ 48));
	if(c) putc(c);
}
int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '#' || c == '.'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '#' || c == '.' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}
void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args >
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = sm(x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }
#define N 250010
#define B 1110
const int T = 2;
const int len = 1 << T;
int n, m, idx;
int a[N], asum[B][len + 5], L[N], R[N], belong[N];
int sum[B][len + 5];
std::vector <int> vec[B];
int queryR(int b) { /* printf("queryR(%d %d) = %d\n", L[b], R[b], asum[b][(int)vec[b].size() % len] ^ sum[b][(int)(vec[b].size() + 1) % len]); */ 
	return asum[b][(int)vec[b].size() % len] ^ sum[b][(int)(vec[b].size() + 1) % len]; }
void rebuild(int b)
{
	for(int i = 0; i < len; i++) sum[b][i] = 0, asum[b][i] = a[R[b] - i];
	for(int j = 0; j < T; j++) for(int i = 0; i < len; i++) if(i >> j & 1) asum[b][i] ^= asum[b][i ^ (1 << j)];
}
void pushdown(int b)
{
	// printf("pushdown([%d %d])\n", L[b], R[b]);
static int tmp[B], m, v[N];
	m = vec[b].size(); if(!m) return;
	for(int i = L[b]; i <= R[b]; i++) tmp[i - L[b]] = a[i];
	for(int j = 0; j < T; j++) if(m >> j & 1) for(int i = 0; i < len; i++) if(i >> j & 1) tmp[i] ^= tmp[i ^ (1 << j)];
	for(int i = 0; i < len; i++) v[i] = 0;
	for(m = 0; !vec[b].empty(); vec[b].pop_back()) v[m++] = vec[b].back();
	for(int j = 0; (1 << j) < m; j++) for(int i = 0; i < m; i++) if(!(i >> j & 1)) v[i] ^= v[i ^ (1 << j)];
	for(int i = 0; i < len; i++) tmp[i] ^= v[i];
	for(int i = L[b] ; i <= R[b]; i++) a[i] = tmp[i - L[b]];
	rebuild(b);
}
void brute(int v, int l, int r)
{
	pushdown(belong[l]);
	for(int i = r; i > l; i--) a[i] ^= a[i - 1];
	a[l] ^= v;
	rebuild(belong[l]);
}
void change(int l, int r)
{
static int tmp[N];
	if(belong[l] == belong[r]) return brute(0, l, r);
	for(int i = belong[l]; i < belong[r]; i++) tmp[i] = queryR(i);
	brute(0, l, R[belong[l]]); brute(tmp[belong[r] - 1], L[belong[r]], r);
	for(int b = belong[l] + 1; b < belong[r]; b++) vec[b].push_back(tmp[b - 1]), sum[b][(int)vec[b].size() % len] ^= tmp[b - 1];
}
void solve()
{
	n = read(), m = read();
	for(int i = 1; i <= n; i++) a[i] = read();
	for(int i = 1; i <= n; i++) belong[i] = (i - 1) / len + 1;
	for(int i = 1; i <= belong[n]; i++) L[i] = (i - 1) * len + 1, R[i] = i * len;
	for(int i = n + 1; i <= R[belong[n]]; i++) belong[i] = belong[n];
	idx = belong[n];
	for(int b = 1; b <= idx; b++) rebuild(b);
	for(int i = 1, op, x, y; i <= m; i++)
	{
		op = read(), x = read();
		if(op == 1) { y = read(); change(x, y); /* printf("change(%d %d) ed\n", x, y); */ }
		else { /* printf("x = %d\n", x); */ pushdown(belong[x]); print(a[x], '\n'); }
	}
	for(int i = 1; i <= idx; i++) pushdown(i);
	for(int i = 1; i <= n; i++) print(a[i], '\n');
}
void init()
{
	read();
}
char _ED_;
void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init(); 
	int T = 1;
	for(; T; solve(), T--);
}
#ifdef int
	#undef int
#endif
}

int main()
{
	uvu::mian(); return 0;
}