#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define pll pair<ll, ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
ll n, q, a[200005], sz[2];
ll seg[2][200005];
void cons(bool id) {
if (sz[id]) iloop(sz[id]-1, 0) seg[id][i] = seg[id][i<<1] ^ seg[id][i<<1|1];
}
void upd(ll X, ll V) {
bool st = X&1;
X /= 2;
for (seg[st][X += sz[st]] = V; X > 1; X >>= 1) seg[st][X>>1] = seg[st][X] ^ seg[st][X^1];
}
ll qu(ll S, ll E) {
if ((S+E)%2) return 0;
bool st = S&1;
S /= 2, E /= 2;
E++;
ll res = 0;
for (S += sz[st], E += sz[st]; S < E; S >>= 1, E >>= 1) {
if (S&1) res ^= seg[st][S++];
if (E&1) res ^= seg[st][--E];
}
return res;
}
ll cmd, t1, t2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, q;
cin >> n >> q;
iloop(0, n) cin >> a[i];
sz[0] = (n+1)/2, sz[1] = n/2;
iloop(0, sz[0]) seg[0][(n+1)/2+i] = a[2*i];
iloop(0, sz[1]) seg[1][n/2+i] = a[2*i + 1];
cons(0); cons(1);
while (q--) {
cin >> cmd >> t1 >> t2;
if (cmd == 1) upd(t1-1, t2);
else cout << qu(t1-1, t2-1) << "\n";
}
}
