#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e9+7;
const int MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ii>
#define f(i,a,b) for(int i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll bit[200005][2];
ll n;
void upd(ll k,ll x,ll pos){
while(pos <= n){
bit[pos][x] ^= k;
pos += pos & -pos;
}
}
ll query(ll k,ll x){
ll ans = 0;
while(k >= 1){
ans ^= bit[k][x];
k -= k & -k;
}
return ans;
}
int main(void){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll q;
cin>>n>>q;
ll arr[n];
f(i,0,n){
cin>>arr[i];
upd(arr[i],(i+1) % 2,i+1);
}
while(q--){
ll t,l,r;
cin>>t>>l>>r;
if(t == 1){
upd(arr[l-1],l % 2,l);
arr[l-1] = r;
upd(arr[l-1],l % 2,l);
}
else{
ll siz = r - l + 1;
if(siz % 2 == 0){
cout<<"0\n";
}
else{
cout<<(query(r,l % 2) ^ query(l-1,l % 2))<<"\n";
}
}
}
}
