#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define forin for(int i = 1; i <= n; i++)
#define stforin for(int i = 0; i < n; i++)
#define forim for(int i = 1; i <= m; i++)
#define forjn for(int j = 1; j <= n; j++)
#define forch(j, n) for(int i = j; i <= n; i++)
#define forch2(i, j, n) for(int i = j; i <= n; i++)
#define forjm for(int j = 1; j <= m; j++)
#define lol long long
#define lb long double
#define all(a) (x).begin(), (x).end();
#define endl '\n'
#define debug cout << "Completed" << endl;
#define fix(n, m) cout << fixed; cout.precision(m); cout << n << endl
#define pll pair<lol, lol>
#define mod 1000000007
#define fst first
#define snd second
#define inf 1e15
#define tofix cin
; string sbuf;
ostringstream buf(sbuf);
istringstream atcin(sbuf);
//priority_queue <pll, vector<pll>, greater<pll>> q
const long long N = 2e5 + 10;
lol n, q, a[N], cnt[N], c, l, r, ans;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> q;
forin cin >> a[i];
forch2(_, 1, q) {
cin >> c >> l >> r;
if (c == 1) a[l] = r;
if (c == 2) {
forch(1, r - l + 1) {
forch2(j, l, l + i - 1) cnt[j] += j-l+1;
for (int j = r; j >= r - i + 1; j--) cnt[j] = r-j+1;
forch2(j, l + i, r - i) cnt[j] += i;
}
ans = 0;
forch(l, r) {
if(cnt[i] % 2 == 1) ans ^= a[i];
cnt[i] = 0;
}
cout << ans << endl;
}
}
}
