#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if(x < 0) x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if(x < 0) x += mod;
}
struct SegmentTree
{
vector<int> st;
int n;
/// real n
SegmentTree(int _n = 0) : n(_n)
{
st.resize(4 * n + 10);
}
void resize(int _n)
{
n = _n;
st.resize(4 * n + 10);
}
void assign(int id, int l, int r, int x, int val)
{
if (x > r or x < l)
return;
if (l == r)
{
st[id] = val;
return;
}
int mid = (l + r) >> 1;
assign(id << 1, l, mid, x, val);
assign(id << 1 | 1, mid + 1, r, x, val);
st[id] = st[id << 1] ^ st[id << 1 | 1];
}
int get(int id, int l, int r, int u, int v)
{
if (l > v || u > r)
return 0;
if (u <= l && r <= v)
return st[id];
int mid = (l + r) >> 1;
return get(id << 1, l, mid, u, v) ^ get(id << 1 | 1, mid + 1, r, u, v);
}
int get(int l, int r)
{
return get(1, 1, n, l, r);
}
void assign(int x, int val)
{
assign(1, 1, n, x, val);
}
}t[2];
int n,a[maxn],q;
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
t[0].resize(n);
t[1].resize(n);
fo(i,1,n)
{
cin >> a[i];
t[i & 1].assign(i,a[i]);
}
while(q--)
{
int ty;
cin >> ty;
if(ty == 1)
{
int x,val;
cin >> x >> val;
t[x & 1].assign(x,val);
}
else
{
int l,r;
cin >> l >> r;
if(l % 2 == r % 2)
cout << t[l % 2].get(l,r) << "\n";
else cout << 0 << "\n";
}
}
}
