//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define mt19937_64 mt_rand(chrono::steady_clock::now().time_since_epoch().count())
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const int MOD=998244353;
const int INF=1000000007;
const ll LINF=4e18;
const int MAXN=2e5+5;
ll a[MAXN];
ll p[MAXN];
void build(int n){
p[0] = 0;
for(int i=1;i<=n;i++){
p[i] = p[i-1] ^ a[i];
}
}
signed main(){
fastio;
#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
int t=1;
//cin >> t;
while(t--){
int n,q;
cin >> n >> q;
for(int i=1;i<=n;i++){
cin >> a[i];
}
build(n);
while(q--){
int type;
cin >> type;
if(type == 1){
int idx,x;
cin >> idx >> x;
a[idx] = x;
build(n);
}
else{
int l,r;
cin >> l >> r;
ll ans = 0;
for(int j=l;j<=r;j++){
if(((j-l+1)&1)==1){
ans ^= p[j];
}
}
for(int i=l;i<=r;i++){
if(((r-i+1)&1)==1){
ans ^= p[i-1];
}
}
cout << ans << endl;
}
}
}
}
