#include<bits/stdc++.h>
using namespace std;
struct Node{
int odd = 0, even = 0;
};
struct SegmentTree{
vector<Node>sTree;
SegmentTree(int n){
sTree.resize(4 * n);
}
Node Merge(Node &left, Node &right){
Node res = {left.odd ^ right.odd, left.even ^ right.even};
return res;
}
void Build(int node, int l, int r, vector<int>&v){
if(l == r){
if(l & 1)sTree[node] = {v[l], 0};
else sTree[node] = {0, v[l]};
}
else{
int mid = (l + r) >> 1;
Build(node * 2, l, mid, v);
Build(node * 2 + 1, mid + 1, r, v);
sTree[node] = Merge(sTree[node * 2], sTree[node * 2 + 1]);
}
}
void Update(int node, int l, int r, int pos, int val){
if(l == r){
if(l & 1)sTree[node] = {val, 0};
else sTree[node] = {0, val};
}
else{
int mid = (l + r) >> 1;
if(pos <= mid){
Update(node * 2, l, mid, pos, val);
}
else{
Update(node * 2 + 1, mid + 1, r, pos, val);
}
sTree[node] = Merge(sTree[node * 2], sTree[node * 2 + 1]);
}
}
Node Query(int node, int l, int r, int ql, int qr){
if(ql <= l && r <= qr){
return sTree[node];
}
if(ql > r || l > qr){
Node ide;
return ide;
}
int mid = (l + r) >> 1;
Node lc = Query(node * 2, l, mid, ql, qr);
Node rc = Query(node * 2 + 1, mid + 1, r, ql, qr);
return Merge(lc, rc);
}
};
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int>v(n + 1);
for(int i = 1;i <= n;++i){
cin >> v[i];
}
SegmentTree tree(n);
tree.Build(1, 1, n, v);
while(q--){
int type;
cin >> type;
if(type == 1){
int pos, val;
cin >> pos >> val;
tree.Update(1, 1, n, pos, val);
}
else{
int l, r;
cin >> l >> r;
if(l % 2 != r % 2){
cout << 0 << '\n';
}
else{
Node res = tree.Query(1, 1, n, l, r);
if(l % 2)cout << res.odd << '\n';
else cout << res.even << '\n';
}
}
}
}
