#include "iostream"
#include "cstring"
#include "cstdio"
#include "algorithm"
#include "queue"
#include "vector"
#include "queue"
#include "stack"
#include "ctime"
#include "set"
#include "map"
#include "cmath"
using namespace std;
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define rep( i , a , b ) for( int i = (a) , i##end = b ; i <= i##end ; ++ i )
#define per( i , a , b ) for( int i = (a) , i##end = b ; i >= i##end ; -- i )
#define mem( a ) memset( a , 0 , sizeof (a) )
#define all( x ) x.begin() , x.end()
//#define int long long
typedef long long ll;
const int MAXN = 2e5 + 10;
int n , q;
int A[MAXN];
void solve() {
	cin >> n >> q;
	rep( i , 1 , n ) scanf("%d",A + i);
	int res = 0;
	rep( i , 1 , q ) {
		int op , l , r;
		scanf("%d",&op);
		if( op == 1 ) {
			scanf("%d%d",&l,&r);
			int len = r - l + 1;
			per( i , n , r + 1 ) A[i] = A[i - len];
		} else {
			scanf("%d",&l);
			res ^= A[l];
		}
	}
	cout << res << endl;
}

signed main() {
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	int T;cin >> T;while( T-- ) solve();
//	solve();
}