#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>


struct F{
    int l = -1;
    int r = -1;
    array<int, 2> dp;
};

F op(F l, F r){
    if (l.l == -1) return r;
    if (r.r == -1) return l;
    F res;
    res.l = l.l;
    res.r = r.r;
    rep(i, 0, 2) res.dp[i] = max(l.dp[i], r.dp[i]);
    int v = min(l.r, r.l);
    chmax(res.dp[0], v);
    chmax(res.dp[1], min(v, max(l.dp[0], r.dp[0])));
    chmax(res.dp[1], min(l.dp[0], r.dp[0]));
    return res;
}

F e(){
    return F{};
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, Q;
    cin >> N >> Q;
    vector<F> base(N);
    rep(i, 0, N){
        int a;
        cin >> a;
        base[i].l = a;
        base[i].r = a;
    }
    atcoder::segtree<F, op, e> seg(base);
    while (Q--){
        int t;
        cin >> t;
        if (t == 1){
            int ind;
            int x;
            cin >> ind >> x;
            ind--;
            auto tmp = seg.get(ind);
            tmp.l = x;
            tmp.r = x;
            seg.set(ind, tmp);
        }
        else{
            int l, r;
            cin >> l >> r;
            l--;
            F tmp;
            tmp.l = INF;
            tmp.r = INF;
            cout << op(tmp, op(seg.prod(l, r), tmp)).dp[1] << "\n";
        }
    }
}