#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

// 挿入関数・削除関数を定義していく
void all_insert(multiset<ll> &ms1, multiset<ll> &ms2, ll val){
    auto it = ms1.lower_bound(val);
    if (it == ms1.begin()){
        ll v1 = *it;
        ms1.insert(val);
        ms2.insert(v1 ^ val);
    }
    else if (it == ms1.end()){
        it--;
        ll v1 = *it;
        ms1.insert(val);
        ms2.insert(v1 ^ val);
    }
    else{
        ll v1 = *it;
        it--;
        ll v2 = *it;
        ms2.erase(ms2.find(v1 ^ v2));
        ms1.insert(val);
        ms2.insert(v1 ^ val);
        ms2.insert(v2 ^ val);
    }
    return;
}

void all_erase(multiset<ll> &ms1, multiset<ll> &ms2, ll val){
    auto it = ms1.lower_bound(val);
    ms1.erase(it);
    it = ms1.lower_bound(val);
    if (it == ms1.begin()){
        ll v = *it;
        ms2.erase(ms2.find(val ^ v));
    }
    else if (it == ms1.end()){
        it--;
        ll v = *it;
        ms2.erase(ms2.find(val ^ v));
    }
    else{
        ll v1 = *it;
        it--;
        ll v2 = *it;
        ms2.insert(v1 ^ v2);
        ms2.erase(ms2.find(v1 ^ val));
        ms2.erase(ms2.find(v2 ^ val));
    }
    return;
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];

    vector<ll> id(Q, -1);
    vector<ll> x(Q, -1);
    vector<ll> r(Q, -1);
    for (ll i = 0; i < Q; i++){
        ll t;
        cin >> t;
        if (t == 1){
            cin >> id[i] >> x[i];
            id[i]--;
        }
        else{
            cin >> r[i];
            r[i]--;
        }
    }
    vector<ll> prevs(Q, -1);
    for (ll i = 0; i < Q; i++){
        if (id[i] != -1){
            prevs[i] = A[id[i]];
            A[id[i]] = x[i];
        }
    }
    for (ll i = Q - 1; i >= 0; i--){
        if (id[i] != -1){
            A[id[i]] = prevs[i];
        }
    }
    ll B = 100;
    vector<vector<pll>> qs(Q / B + 1, vector<pll>(0));
    for (ll i = 0; i < Q; i++){
        if (id[i] != -1) continue;
        qs[i / B].push_back(make_pair(r[i], i));
    }
    for (ll i = 0; i < Q / B; i++){
        sort(all(qs[i]));
    }
    multiset<ll> ms1;
    multiset<ll> ms2;
    ms1.insert(A[0]);
    ms1.insert(A[1]);
    ms2.insert(A[0] ^ A[1]);
    
    vector<ll> ans(Q, -1);
    ll prev_l = -1;
    ll prev_r = 1;
    for (ll i = 0; i < Q / B; i++){
        for (ll j = 0; j < qs[i].size(); j++){
            ll nl = qs[i][j].second;
            ll nr = qs[i][j].first;
            if (nr < prev_r){
                for (ll k = prev_r; k > nr; k--){
                    all_erase(ms1, ms2, A[k]);
                }
            }
            else{
                for (ll k = prev_r + 1; k <= nr; k++){
                    all_insert(ms1, ms2, A[k]);
                }
            }
            if (nl > prev_l){
                for (ll k = prev_l + 1; k <= nl; k++){
                    if (id[k] != -1 && id[k] <= nr){
                        all_erase(ms1, ms2, A[id[k]]);
                        A[id[k]] = x[k];
                        all_insert(ms1, ms2, A[id[k]]);
                    }
                }
            }
            else{
                for (ll k = prev_l; k > nl; k--){
                    if (id[k] != -1 && id[k] <= nr){
                        all_erase(ms1, ms2, A[id[k]]);
                        A[id[k]] = prevs[k];
                        all_insert(ms1, ms2, A[id[k]]);
                    }
                }
            }
            ans[nl] = *(ms2.begin());
            prev_l = nl;
            prev_r = nr;
        }
    }
    for (ll i = 0; i < Q; i++){
        if (ans[i] != -1){
            cout << ans[i] << endl;
        }
    }
}