#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 3e5 + 100;
int seg[mxN * 4][2], n;
void update(int node, int start, int end, int idx, int val){
if(start == end){
seg[node][idx & 1] = val;
return;
}
int mid = start + (end - start) / 2;
if(idx <= mid) update(node * 2 + 1, start, mid, idx, val);
else update(node * 2 + 2, mid + 1, end, idx, val);
seg[node][0] = seg[node * 2 + 1][0] ^ seg[node * 2 + 2][0];
seg[node][1] = seg[node * 2 + 1][1] ^ seg[node * 2 + 2][1];
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return 0;
if(start >= l && end <= r) return seg[node][l & 1];
int mid = start + (end - start) / 2;
return query(node * 2 + 1, start, mid, l, r) ^ query(node * 2 + 2, mid + 1, end, l, r);
}
int query(int l, int r){
return query(0, 1, n, l, r);
}
void update(int i, int val){
update(0, 1, n, i, val);
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int q;
cin >> n >> q;
for(int i = 1, x; i <= n; ++i){
cin >> x;
update(i, x);
}
while(q--){
int t, l, r;
cin >> t >> l >> r;
if(t == 1){
update(l, r);
}else{
if((r - l + 1) & 1) cout << query(l, r) << "\n";
else cout << "0\n";
}
}
return 0;
}
