#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include <bits/stdc++.h>
using namespace std;

inline char gc() {
	static char buf[1 << 16];
	static size_t bc, be;
	if (bc >= be) {
		buf[0] = 0, bc = 0;
		be = fread(buf, 1, sizeof(buf), stdin);
	}
	return buf[bc++];
}
 
int readInt() {
	int a, c;
	while ((a = gc()) < 40);
	if (a == '-') return -readInt();
	while ((c = gc()) >= 48) a = a * 10 + c - 480;
	return a - 48;
}

void solve() {
	int n = readInt(), q = readInt();
	int a[n];
	for (int i = 0; i < n; i++) {
		a[i] = readInt();
	}

	int res = 0;
	while (q--) {
		int t = readInt(); 

		if (t == 1) {
			int l = readInt(), r = readInt(); l--;
			int len = r-l;
			int i = n-1;
			for (; i-4 >= r; i -= 4) {
				a[i] = a[i-len];
				a[i-1] = a[i-len-1];
				a[i-2] = a[i-len-2];
				a[i-3] = a[i-len-3];
			}
			for (; i >= r; i--) {
				a[i] = a[i-len];
			}
		} else {
			int x = readInt(); x--;
			res ^= a[x];
		}
	}
	cout << res << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t = readInt();
	while (t--) {
		solve();
	}
	
	return 0;
}