#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll dim=1e6 + 10;
const ll mod= 998244353;
const ll inf=1e18+77;
//#define endl "\n"
#define fi first
#define pb push_back
#define se second
#define vll vector<ll>
ll n, k, q;
ll a[dim];
void bd(ll v, ll tl, ll tr, ll tx[], ll tp){
if(tl==tr){
if(tp==0){
tx[v]=a[tl];
}
else if(tp==1){
if(tl&1)tx[v]=a[tl];
else tx[v]=0;
}
else if(tp==2){
if(tl%2==0)tx[v]=a[tl];
else tx[v]=0;
}
return;
}
ll tm=(tl+tr)/2;
bd(2*v, tl, tm, tx, tp);
bd(2*v+1, tm+1, tr, tx, tp);
tx[v]=(tx[2*v]^tx[2*v+1]);
}
ll get(ll v, ll tl, ll tr, ll l, ll r, ll tx[]){
if(l>tr || r<tl)return 0;
if(l<= tl && tr<=r)return tx[v];
ll tm=(tl+tr)/2;
return (get(2*v, tl, tm, l, r, tx)^get(2*v+1, tm+1, tr, l, r, tx ));
}
void upd(ll v, ll tl, ll tr, ll pos, ll val, ll tx[]){
if(pos>tr || pos<tl)return;
if(tl==tr){
tx[v]=val;
return;
}
ll tm=(tl+tr)/2;
upd(2*v, tl, tm, pos, val, tx);
upd(2*v+1, tm+1, tr, pos, val, tx);
tx[v]=(tx[2*v]^tx[2*v+1]);
}
ll t[4*dim], t1[4*dim], t2[4*dim];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll tt;
//cin>>tt;
tt=1;
while(tt--){
ll x, y;
cin>>n>>q;
for(int i=1; i<=n; i++){
cin>>a[i];
}
bd(1, 1, n, t, 0);
bd(1,1, n, t1, 1);
bd(1, 1, n, t2, 2);
while(q--){
ll tp, l, r, p, v;
cin>>tp;
if(tp==1){
cin>>p>>v;
a[p]=v;
if(p&1)upd(1, 1, n, p, v, t1);
else upd(1, 1, n, p, v, t2);
upd(1, 1, n, p, v, t);
}
else{
cin>>l>>r;
ll ans=0;
ll len=r-l+1;
len=(len%2);
if(len&1){
if(l&1)ans=get(1, 1, n, l, r, t1 );
else ans=get(1, 1, n, l, r, t2 );
}
else{
ans=get(1, 1, n, l, r, t);
}
cout<<ans<<endl;
}
}
}
return 0;
}
