#include <bits/stdc++.h>
using namespace std;
#define ff(i, a, b) for(auto i=(a); i<=(b); ++i)
#define ffr(i, b, a) for(auto i=(b); i>=(a); --i)
#define nl "\n"
#define ss " "
#define sz size()
#define pb emplace_back
#define pf push_front
#define fi first
#define se second
#define ms(a,x) memset(a, x, sizeof (a))
#define re exit(0)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;
const ll mod=1e9+7, maxn=3e5+5, inf=1e18;
void rf(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
if(fopen("o.inp","r")){
freopen("o.inp","r",stdin); freopen("o.out","w",stdout);
}
}
int n, q, a[maxn], f[5005][5005];
int main()
{
rf();
cin>>n>>q;
ff(i, 1, n) cin>>a[i];
ff(i, 1, n) ff(j, i, n) ff(k, i, j) f[i][j]^=a[k];
while(q--)
{
int op, l, r; cin>>op>>l>>r;
if(op==1) a[l]=r;
else
{
if(n<=100)
{
int ans=0;
ff(i, l, r) ff(j, i, r) ff(k, i, j) ans^=a[k];
cout<<ans<<nl;
}
else if(n<=500)
{
int ans=0;
ff(i, l, r) ff(j, i, r) ans^=f[i][j];
cout<<ans<<nl;
}
}
}
re;
}
