#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct MinXorSet {
    multiset<int> ms1, ms2;

    void insert(int v) {
        auto itr = ms1.lower_bound(v);
        if(itr != ms1.begin() && itr != ms1.end()) {
            ms2.erase(ms2.find(*prev(itr) ^ (*itr)));
        }
        if(itr != ms1.begin()) {
            ms2.insert(*prev(itr) ^ v);
        }
        if(itr != ms1.end()) {
            ms2.insert(v ^ (*itr));
        }
        ms1.insert(v);
    }

    void erase(int v) {
        ms1.erase(ms1.find(v));
        auto itr = ms1.lower_bound(v);
        if(itr != ms1.begin() && itr != ms1.end()) {
            ms2.insert(*prev(itr) ^ (*itr));
        }
        if(itr != ms1.begin()) {
            ms2.erase(ms2.find(*prev(itr) ^ v));
        }
        if(itr != ms1.end()) {
            ms2.erase(ms2.find(v ^ (*itr)));
        }
    }

    int query() {
        if(ms2.empty()) return INF;
        else return *ms2.begin();
    }
};

const int B = 345;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

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

    int C = (N + B - 1) / B;
    vector<MinXorSet> st(C);
    rep(i, N)FOR(k, i / B, C) st[k].insert(A[i]);

    while(Q--) {
        int op;
        cin >> op;
        if(op == 1) {
            int i, x;
            cin >> i >> x;
            i--;
            debug(Q, op, i, x);

            FOR(k, i / B, C) {
                st[k].erase(A[i]);
                st[k].erase(x);
            }

            A[i] = x;
        }
        else{
            int r;
            cin >> r;

            if(r <= B) {
                MinXorSet s;
                rep(i, r) s.insert(A[i]);
                cout << s.query() << "\n";
                continue;
            }

            int k = r / B - 1;
            debug(Q, op, r, k);
            int ans = st[k].query();

            MinXorSet s;
            FOR(i, (k + 1) * B, r) {
                s.insert(A[i]);
            }
            chmin(ans, s.query());

            FOR(i, (k + 1) * B, r) {
                st[k].insert(A[i]);
                chmin(ans, st[k].query());
                st[k].erase(A[i]);
            }

            cout << ans << "\n";
        }
    }
}