#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define inf 1e18
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, q, t[100001], seg[400001], a, b;

int max(int i, int j){
    if(i>j) return i;
    else return j;
}

inline void upd(int node, int l, int r){
    if(r<a || l>a) return;
    else if(l==r) seg[node]=b;
    else{
        int mid=(l+r)/2;
        if(a<=mid) upd(2*node, l, mid);
        else upd(2*node+1, mid+1, r);
        seg[node]=max(seg[2*node], seg[2*node+1]);
    }
}

inline int qry(int node, int l, int r){
    if(r<a || l>b) return (int)-1e9;
    else if(a<=l && r<=b) return seg[node];
    else{
        int mid=(l+r)/2;
        int m1=qry(2*node, l, mid), m2=qry(2*node+1, mid+1, r);
        return max(m1, m2);
    }
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");
    cin>>n>>q;
    for(int i=1; i<=n; i++){
        cin>>b;
        a=i;
        upd(1, 1, n);
    }
    //build(1, 1, n);
    for(int i=1; i<=q; i++){
        int x;
        cin>>x>>a>>b;
        if(x==0) cout<<qry(1, 1, n)<<"\n";
        else upd(1, 1, n);
    }
}