// Problem: P6225 [eJOI2019] 异或橙子
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P6225
// Memory Limit: 62 MB
// Time Limit: 1000 ms

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
int n,q,a[N];
struct Tree{
	struct node{
		int l,r,s;
	}t[N*4];
	void build(int p,int l,int r,bool vis){
		t[p].l=l;
		t[p].r=r;
		if(l==r){
			if(vis) t[p].s=l%2==1?a[l]:0;
			else t[p].s=l%2==0?a[l]:0;
			return ;
		}
		int mid=(l+r)>>1;
		build(p*2,l,mid,vis);
		build(p*2+1,mid+1,r,vis);
		t[p].s=t[p*2].s^t[p*2+1].s;
		return ;
	}
	void change(int p,int x,int k){
		int l=t[p].l;
		int r=t[p].r;
		if(l==r){
			t[p].s=k;
			return ;
		}
		int mid=(l+r)>>1;
		if(x<=mid) change(p*2,x,k);
		else change(p*2+1,x,k);
		t[p].s=t[p*2].s^t[p*2+1].s;
		return ;
	}
	int ask(int p,int x,int y){
		int l=t[p].l;
		int r=t[p].r;
		if(x<=l&&y>=r){
			return t[p].s;
		}
		int mid=(l+r)>>1,ans=0;
		if(x<=mid) ans^=ask(p*2,x,y);
		if(y>mid) ans^=ask(p*2+1,x,y);
		return ans;
	}
}tree1,tree2;

int main(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	tree1.build(1,1,n,1);
	tree2.build(1,1,n,0);
	while(q--){
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		if(x%2!=y%2){
			if(op==1) printf("0\n");
			continue;
		}
		if(op==1){
			x%2==1 ? tree1.change(1,x,y):tree2.change(1,x,y);
		}
		else
			printf("%d\n",x%2==1?tree1.ask(1,x,y):tree2.ask(1,x,y));
	}
	
	return 0;
}