#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
int wiel = 1024*512-1;
int drzewo[2][1024*512-1];
int query_t(int akt, int p1, int p2, int s1, int s2, int p)
{
if(p2 < s1 || p1 > s2) return 0;
if(p1 >= s1 && p2 <= s2) return drzewo[p][akt-1];
return query_t(akt*2,p1,(p1+p2)/2,s1,s2,p) ^ query_t(akt*2+1,(p1+p2)/2+1,p2,s1,s2,p);
}
void add_t(int akt, int p)
{
drzewo[p][akt-1] = drzewo[p][akt*2-1] ^ drzewo[p][akt*2];
if(akt != 1) add_t(akt/2,p);
}
void change_t(int poz, int war, int p)
{
drzewo[p][wiel/2+poz] = war;
add_t((wiel/2+poz+1)/2,p);
}
void solve()
{
int n,q;
cin >> n >> q;
rep(i,n)
{
int a;
cin >> a;
change_t(i/2,a,i%2);
}
rep(i,q)
{
int type,a,b;
cin >> type >> a >> b;
if(type == 1)
{
change_t((a-1)/2,b,(a-1)%2);
}
else
{
if((b-a+1) % 2 == 0) cout << 0 << "\n";
else
{
cout << query_t(1,0,wiel/2,(a-1)/2,(b-1)/2,(a-1)%2) << "\n";
}
}
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int t = 1;
//cin >> t;
while(t--) solve();
}
