#include<bits/stdc++.h>
using namespace std; 
const int N=100010;  
bitset<N>ans;  
int a[N];  
struct que{  
    int oper,l,r;  
};  
que q[N];  
int n;
void solve(){  
    int k;  
    scanf("%d %d",&n,&k);     //左移或右移  
    ans.reset();  
    for(int i=1;i<=n;i++){  
        scanf("%d",&a[i]);  
    }  
    for(int i=1;i<=k;i++){  
        scanf("%d",&q[i].oper);  
        if(q[i].oper==1){  
            scanf("%d %d",&q[i].l,&q[i].r);  
        }  
        if(q[i].oper==2){  
            scanf("%d",&q[i].l);  
        }  
    }  
    for(int i=k;i>=1;i--){  
        int oper=q[i].oper;  
        int l=q[i].l;  
        int r=q[i].r;  
        if(oper==2){  
            ans[l]=1-ans[l];  
        }  
        else {  
            auto a = ans & (~bitset<N>(0) >> (N - r - 1));  
            auto b = ans & (~bitset<N>(0) << (r + 1));  
            ans = a ^ (b >> (r + 1 - l));  
        }  
    }  
    long long res=0;  
    for(int i=1;i<=n;i++){  
        if(ans[i])  res^=a[i];  
    }  
    printf("%lld\n",res);  
    return ;  
}

int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
}