#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
template <class T> void minimize (T &t, T f) {if (t > f) t = f;}
template <class T> void maximize (T &t, T f) {if (t < f) t = f;}
const int maxN = 2e5 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
// khong tu code thi khong kha len duoc dau
int a[maxN];
struct IT {
int st[maxN * 4];
void upd (int id, int l, int r, int pos, int val) {
if (pos < l || pos > r) {
return;
}
if (l == r) {
st[id] = val;
return;
}
int mid = (l + r) >> 1;
upd (id * 2, l, mid, pos, val);
upd (id * 2 + 1, mid + 1, r, pos, val);
st[id] = st[id * 2] ^ st[id * 2 + 1];
return;
}
int get (int id, int l, int r, int u, int v) {
if (v < l || u > r) {
return 0;
}
if (u <= l && r <= v) {
return st[id];
}
int mid = (l + r) >> 1;
int tL = get (id * 2, l, mid, u, v);
int tR = get (id * 2 + 1, mid + 1, r, u, v);
return (tL ^ tR);
}
} T[2];
void solve () {
int n, q;
cin >> n >> q;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
T[i % 2].upd (1, 1, n, i, a[i]);
T[(i + 1) % 2].upd (1, 1, n, i, 0);
}
while (q --) {
int t;
cin >> t;
if (t == 1) {
int i, j;
cin >> i >> j;
a[i] = j;
T[i % 2].upd (1, 1, n, i, a[i]);
}
else {
int l, r;
cin >> l >> r;
if ((r - l + 1) % 2 == 1) {
cout << T[l % 2].get (1, 1, n, l, r) << '\n';
}
else {
cout << 0 << '\n';
}
}
}
return;
}
signed main () {
cin.tie (nullptr) -> sync_with_stdio (false);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int t = 1;
//cin >> t;
while (t --) {
solve ();
}
return 0;
}
// thfv
