#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll


ifstream fin("arbint.in"); ofstream fout("arbint.out");
#define cin fin
#define cout fout


int n, m, a[300010];


int tree[4*100000+1];

void buildTree(int v, int l, int r){

if(l==r){
    tree[v]=a[l];
    return;
}
int mid=(l+r)>>1ll;
buildTree(2*v, l, mid);
buildTree(2*v+1, mid+1, r);
tree[v]=max(tree[2*v],tree[2*v+1]);

}


void update(int v, int tl, int tr, int p, int x){

if(tl==tr){
    a[p]=x;
    tree[v]=a[p];
    return;
}

int mid=(tl+tr)>>1ll;
if(p<=mid){
    update(2*v, tl, mid, p, x);
}
else{
    update(2*v+1, mid+1, tr, p, x);
}
tree[v]=max(tree[2*v], tree[2*v+1]);

}


int query(int v, int tl, int tr, int l, int r){

if(l>r){
    return 0;
}

if(tl==l && tr==r){
    return tree[v];
}
int mid=(tr+tl)>>1ll;
return max( query(2*v, tl, mid, l, min(r, mid)), query(2*v+1, mid+1, tr, max(l, mid+1), r)  );

}


int32_t main(){
INIT
cin>>n>>m;
for(int i=1; i<=n; i++){
    cin>>a[i];
}
buildTree(1, 1, n);


for(int i=0; i<m; i++){
    int tp, x, y;
    cin>>tp>>x>>y;
    if(tp==0){
        cout<<query(1, 1, n, x, y)<<"\n";
    }
    else{
        update(1, 1, n, x, y);
    }
}


return 0;
}