#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAX(a, b) (a) = max((a), (b))
#define MIN(a, b) (a) = min((a), (b))
#define all(a) (a).begin(), (a).end()
#define sortedpair(a, b) {min((a), (b)), max((a), (b))}
const ll MOD = 1e9+7;
const int MAXN = 200001;
int n, q;
struct Tree {
vector<int> tree;
Tree() {
tree.resize(2*MAXN);
}
void upd(int u, int k) {
u += n;
tree[u] = k;
for (u /= 2; u >= 1; u /= 2) {
tree[u] = tree[2*u] ^ tree[2*u+1];
}
}
int qry(int l, int r) {
l += n; r += n;
int res = 0;
while (l <= r) {
if (l % 2 == 1) res ^= tree[l++];
if (r % 2 == 0) res ^= tree[r--];
l /= 2; r /= 2;
}
return res;
}
};
void solve(){
cin >> n >> q;
Tree odd, even;
for (int i = 1; i <= n; i++) {
int x; cin >> x;
if (i & 1)
odd.upd(i, x);
else
even.upd(i, x);
}
while (q--) {
int type, l, r; cin >> type >> l >> r;
if (type == 1) {
if (l & 1)
odd.upd(l, r);
else
even.upd(l, r);
} else {
int len = r - l + 1;
if (len & 1) {
if (l & 1) {
cout << odd.qry(l, r) << "\n";
} else {
cout << even.qry(l, r) << "\n";
}
} else {
cout << "0\n";
}
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int _t = 1;
// cin >> _t;
while (_t--) {
solve();
}
return 0;
}
