//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = int;
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;
}

class xor_multiset{
public:
    multiset<ll> val,xr;
    void insert(ll x){
        if(val.empty()){
            val.insert(x);
            return;
        }
        if(val.size() == 1){
            xr.insert(x ^ *val.begin());
            val.insert(x);
            return;
        }

        auto it = val.lower_bound(x);
        if(it == val.begin()){
            xr.insert(*it ^ x);
            val.insert(x);
            return;
        }
        if(it == val.end()){
            it--;
            xr.insert(*it ^ x);
            val.insert(x);
            return;
        }
        auto itl = it; itl--;
        xr.erase(xr.find(*itl ^ *it));
        xr.insert(*itl ^ x);
        xr.insert(*it ^ x);
        val.insert(x);
    }

    void erase(ll x){
        if(val.size() == 1){
            val.clear();
            return;
        }
        if(val.size() == 2){
            xr.clear();
            val.erase(val.find(x));
            return;
        }

        auto it = val.find(x);
        if(it == val.begin()){
            xr.erase(xr.find(*it ^ *next(it)));
            val.erase(it);
            return;
        }
        if(next(it) == val.end()){
            xr.erase(xr.find(*it ^ *prev(it)));
            val.erase(it);
            return;
        }
        
        xr.erase(xr.find(*it ^ *prev(it)));
        xr.erase(xr.find(*it ^ *next(it)));
        xr.insert(*prev(it) ^ *next(it));
        val.erase(it);
        return;
    }
    ll get_min(void){
        // for(auto it = val.begin(); it != val.end(); it++)cerr << *it << ' '; cerr << el;
        // for(auto it = xr.begin(); it !=  xr.end(); it++)cerr << *it << ' '; cerr << el;
        return *xr.begin();
    }
};

#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<int> a = get_vec<int>(n);

    const int block = 110;
    //const int block = 1;

    //{idx,val}
    vector<pair<int,ll>> update(q,pair(-1,-1LL));

    //{time,r}
    vector<pii> query;

    for(int i = 0; i < q; i++){
        int t; cin >> t;
        if(t == 1){
            int idx; cin >> idx; idx--;
            ll x; cin >> x;
            update[i] = pair(idx,x);
        }
        if(t == 2){
            int r;
            cin >> r;
            r--;
            query.push_back(pair(i,r));
        }
    }

    auto comp = [](pii l,pii r){
        if(l.first / block != r.first / block)return (l.first < r.first);
        if((l.first / block) % 2) return (l.second > r.second);
        return (l.second < r.second);
    };
    
    sort(query.begin(),query.end(),comp);
    xor_multiset st;

    int time = -1,right = -1;
    vector<vector<ll>> stack(n);

    vector<ll> ans(q,-1);


    for(int i = 0; i < (int)query.size(); i++){
        //cerr << query[i].first << ' ' << query[i].second << el;
        while(time < query[i].first){
            time++;
            if(update[time].first != -1){
                //cerr << update[time].first << ' ' << a[update[time].first] << el;
                stack[update[time].first].push_back(a[update[time].first]);
                if(update[time].first <= right)st.erase(a[update[time].first]);
                a[update[time].first] = update[time].second;
                if(update[time].first <= right)st.insert(a[update[time].first]);
                //cerr << stack[a[update[time].first]].size() << el;
            }
        }
        while(time > query[i].first){

            if(update[time].first != -1){
                //cerr << stack[a[update[time].first]].size() << el;
                if(update[time].first <= right)st.erase(a[update[time].first]);
                a[update[time].first] = stack[update[time].first].back();
                stack[update[time].first].pop_back();
                if(update[time].first <= right)st.insert(a[update[time].first]);
            }
            time--;
        }
        while(right < query[i].second){
            right++;
            st.insert(a[right]);
        }
        while(right > query[i].second){
            st.erase(a[right]);
            right--;
        }
        ans[query[i].first] = st.get_min();        
    }


    for(int i = 0; i < q; i++){
        if(ans[i] == -1)continue;
        cout << ans[i] << 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;
}