//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
#define MOD 998244353
//#define MOD 1000000007
#define el '\n'
#define El '\n'
#define YESNO(x) ((x) ? "Yes" : "No")
#define YES YESNO(true)
#define NO YESNO(false)
#define EXIT_ANS(x) {cout << (x) << '\n'; return;}
#define PA() {EXIT_ANS(ans);}
template <typename T> void inline SORT(vector<T> &v){sort(v.begin(),v.end()); return;}
template <typename T> void inline REV(vector<T> &v){reverse(v.begin(),v.end()); return;}
template <typename T> void inline VEC_UNIQ(vector<T> &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); return;}
template <typename T> T inline MAX(vector<T> &v){return *max_element(v.begin(),v.end());}
template <typename T> T inline MIN(vector<T> &v){return *min_element(v.begin(),v.end());}
template <typename T> T inline SUM(vector<T> &v){T ans = 0; for(int i = 0; i < (int)v.size(); i++)ans += v[i]; return ans;}
template <typename T> void inline DEC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]--; return;}
template <typename T> void inline INC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]++; return;}
void inline TEST(void){cerr << "TEST" << endl; return;}
template <typename T> bool inline chmin(T &x,T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template <typename T> bool inline chmax(T &x,T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template <typename T = long long> vector<T> inline get_vec(int n){
    vector<T> ans(n);
    for(int i = 0; i < n; i++)cin >> ans[i];
    return ans;
}
template <typename T> void inline print_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cout << vec[i];
        if(kaigyou || i == n - 1)cout << '\n';
        else cout << ' ';
    }
    if(!n)cout << '\n';
    return;
}
template <typename T> void inline debug_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cerr << vec[i];
        if(kaigyou || i == n - 1)cerr << '\n';
        else cerr << ' ';
    }
    if(!n)cerr << '\n';
    return;
}
vector<vector<int>> inline get_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<int>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        if(!direct)g[v].push_back(u);
    }
    return g;
}
template <typename T> vector<vector<pair<T,int>>> inline get_weighted_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<pair<T,int>>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        ll w; cin >> w;
        g[u].push_back(pair(w,v));
        if(!direct)g[v].push_back(pair(w,u));
    }
    return g;
}

#define MULTI_TEST_CASE false
void solve(void){
    //問題を見たらまず「この問題設定から言えること」をいっぱい言う
    //よりシンプルな問題に言い換えられたら、言い換えた先の問題を自然言語ではっきりと書く
    //複数の解法のアイデアを思いついた時は全部メモしておく
    //g++ -D_GLIBCXX_DEBUG -Wall -O2 e.cpp -o o
    int n;
    cin >> n;
    int q; cin >> q;
    vector<ll> a = get_vec(n);

    //const int block = 140;
    const int block = 3;

    vector<multiset<ll>> val(n / block + 2),xr(n / block + 2);
    vector<int> block_idx(n);
    int prevr = -1;
    for(int i = 0; i < n / block + 2; i++){
        if(prevr >= n)break;
        //cerr << i << el;
        int r = (i + 1) * block - 1;
        chmin(r,n - 1);
        if(i){
            val[i] = val[i - 1];
            xr[i] = xr[i - 1];
        }

        for(int j = prevr + 1; j <= r; j++){
            //cerr << i << ' ' << j << ' ' << r <<el;
            block_idx[j] = i;
            if(val[i].empty()){
                val[i].insert(a[j]);
                continue;
            }
            auto itr = val[i].lower_bound(a[j]);
            if(itr == val[i].begin()){
                xr[i].insert(*itr ^ a[j]);
                val[i].insert(a[j]);
                continue;
            }
            if(itr == val[i].end()){
                itr--;
                xr[i].insert(*itr ^ a[j]);
                val[i].insert(a[j]);
                continue;
            }

            auto itl = itr; itl--;
            //itl,itr の間に入れる
            xr[i].erase(xr[i].find(*itl ^ *itr));
            xr[i].insert(*itl ^ a[j]);
            xr[i].insert(*itr ^ a[j]);
            
            val[i].insert(a[j]);
        }
        prevr = r;
    }
    //debug_vec(block_idx);
    
    

    while(q--){
        // for(int i = 0; i < n / block + 2; i++){
        //     for(auto it = xr[i].begin(); it != xr[i].end(); it++)cerr << *it << ' ';
        //     cerr << el;
        // }
        int t; cin >> t;
        if(t == 1){
            int idx;
            ll x;
            cin >> idx >> x;
            idx--;
            for(int i = block_idx[idx]; i <= n / block + 1; i++){
                auto it = val[i].find(a[idx]);
                ll val1 = -1,val2 = -1;
                if(it != val[i].begin()){
                    val1 = *prev(it);
                    xr[i].erase(xr[i].find(*it ^ *prev(it)));
                    
                }
                if(next(it) != val[i].end()){
                    val2 = *next(it);
                    xr[i].erase(xr[i].find(*it ^ *next(it)));
                }
                if(val1 != -1 && val2 != -1)xr[i].insert(val1 ^ val2);
                val[i].erase(it);
            }
            a[idx] = x;

            for(int i = block_idx[idx]; i <= n / block + 1; i++){
                //cerr << i << ' ' << val[i].size() << el;
                auto it = val[i].lower_bound(a[idx]);
                if(it == val[i].begin()){
                    xr[i].insert(*it ^ a[idx]);
                    val[i].insert(a[idx]);
                    continue;
                }
                if(it == val[i].end()){
                    xr[i].insert(*prev(it) ^ a[idx]);
                    val[i].insert(a[idx]);
                    continue;
                }
                // for(auto it = xr[i].begin(); it != xr[i].end(); it++)cerr << *it << ' ';
                // cerr << el;
                
                xr[i].erase(xr[i].find(*prev(it) ^ *it));
                xr[i].insert(*prev(it) ^ a[idx]);
                xr[i].insert(*it ^ a[idx]);
                val[i].insert(a[idx]);
            }
        }

        if(t == 2){
            int r; cin >> r;
            r--;
            int br = block_idx[r];
            multiset<ll> st,stxr;
            if(br != 0){
                st = val[br - 1];
                stxr = xr[br - 1];
            }

            while(r >= 0 && block_idx[r] == br){
                
                auto it = st.lower_bound(a[r]);
                if(it != st.end()){
                    stxr.insert(*it ^ a[r]);
                }
                if(it != st.begin()){
                    it--;
                    stxr.insert(*it ^ a[r]);
                }
                st.insert(a[r]);
                
                r--;
            }
            cout << *stxr.begin() << el;
        }
    }
    return;
}

void calc(void){
    return;
}

signed main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE)cin >> t;
    while(t--){
        solve();
    }
    return 0;
}