#pragma GCC optimize("O3")
#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, a[100001], seg[400001];
void build(int node, int l, int r){
if(l==r) seg[node]=a[l];
else{
int mid=(l+r)/2;
build(2*node, l, mid);
build(2*node+1, mid+1, r);
seg[node]=max(seg[2*node], seg[2*node+1]);
//cout<<l<<" "<<r<<" "<<seg[node]<<endl;
}
}
void upd(int node, int l, int r, int idx, int v){
if(r<idx || l>idx) return;
else if(l==r) seg[node]=v;
else{
int mid=(l+r)/2;
upd(2*node, l, mid, idx, v);
upd(2*node+1, mid+1, r, idx, v);
seg[node]=max(seg[2*node], seg[2*node+1]);
}
}
int qry(int node, int l, int r, int lq, int rq){
if(r<lq || l>rq) return (int)-1e9;
if(l==r) return seg[node];
else{
int mid=(l+r)/2;
return max(qry(2*node, l, mid, lq, rq), qry(2*node+1, mid+1, r, lq, rq));
}
}
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>>a[i];
build(1, 1, n);
for(int i=1; i<=q; i++){
int x, a, b;
cin>>x>>a>>b;
if(x==0) cout<<qry(1, 1, n, a, b)<<"\n";
else upd(1, 1, n, a, b);
}
}