#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[400009];
void update(int nod, int left, int right, int pos, int val)
{
if(left==right)
{
a[nod]=val;
return;
}
int mid=(left+right)/2;
if(pos<=mid) update(2*nod, left, mid, pos, val);
else update(2*nod+1, mid+1, right, pos, val);
a[nod]=max(a[2*nod], a[2*nod+1]);
}
int query(int nod, int left, int right, int l, int r)
{
if(left>=l && right<=r)
return a[nod];
else{
int mid=(left+right)/2, M1=0, M2=0;
if(l<=mid) M1=query(2*nod, left, mid, l, r);
if(mid<r) M2=query(2*nod+1, mid+1, right, l, r);
return max(M1, M2);
}
}
int main()
{
freopen("arbint.in", "r", stdin);
freopen("arbint.out", "w", stdout);
cin>>n>>m;
int x, a, b;
for(int i=1;i<=n;i++)
{
cin>>x;
update(1, 1, n, i, x);
}
for(int i=1;i<=m;i++)
{
cin>>x>>a>>b;
if(x==0)
cout<<query(1, 1, n, a, b)<<'\n' ;
else update(1, 1, n, a, b);
}
return 0;
}