//qoj6975
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;
int n, q, a[N];

struct seg{
    int t[N*4];
    void mdf(int p, int l, int r, int x, int v){
        if(l == r) t[p] = v;
        else {
            int mid = l + r >> 1;
            if(x <= mid) mdf(p<<1, l, mid, x, v);
            else mdf(p<<1|1, mid+1, r, x, v);
            t[p] = t[p<<1] ^ t[p<<1|1];
        }
    }
    int ask(int p, int l, int r, int ql, int qr){
        if(qr < l || r < ql) return 0;
        if(ql <= l && r <= qr) return t[p];
        int mid = l + r >> 1;
        return ask(p<<1, l, mid, ql, qr) ^
                ask(p<<1|1, mid+1, r, ql, qr);
    }
} t, tt;

int main(){
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++ i){
        scanf("%d", &a[i]);
        if(i & 1){
            t.mdf(1, 1, n, i, a[i]);
        } else {
            tt.mdf(1, 1, n, i, a[i]);
        }
    }
    while(q--){
        int op, x, y;
        scanf("%d%d%d", &op, &x, &y);
        if(op == 1){
            if(x & 1){
                t.mdf(1, 1, n, x, y);
            } else {
                tt.mdf(1, 1, n, x, y);
            }
        } else {
            if((y-x) & 1){
                puts("0");
            } else {
                if(x & 1){
                    printf("%d\n", t.ask(1, 1, n, x, y));
                } else {
                    printf("%d\n", tt.ask(1, 1, n, x, y));
                }
            }
        }
    }
    return 0;
}