#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
#define file ""
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return l + rd() % (r - l + 1);
}
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
template<class X, class Y> bool mini(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
int n, q;
int a[N];
struct fenw {
int n;
vector<int> bit;
void init(int _n) {
n = _n;
bit.assign(n + 5, 0);
}
void update(int u, int c) {
for (; u <= n; u += u & -u) bit[u] ^= c;
}
int get(int u) {
int res = 0;
for (; u > 0; u -= u & -u) res ^= bit[u];
return res;
}
int get(int l, int r) {
return get(r) ^ get(l - 1);
}
} t[2];
void process() {
cin >> n >> q;
for (int i = 1; i <= n; ++i) cin >> a[i];
t[0].init(n);
t[1].init(n);
for (int i = 1; i <= n; ++i) t[i & 1].update(i, a[i]);
while (q--) {
int op, x, y;
cin >> op >> x >> y;
if (op == 1) {
t[x & 1].update(x, a[x]);
a[x] = y;
t[x & 1].update(x, a[x]);
} else {
if ((y - x + 1) & 1) cout << t[x & 1].get(x, y) << '\n';
else cout << 0 << '\n';
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
// freopen("input.txt", "r", stdin);
#else
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
#endif
int tc = 1;
// cin >> tc;
while (tc--) {
process();
}
return 0;
}
/*
*/
