#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
#define er erase
#define in insert
#define pi pair <int, int>
#define pii pair <pi, pi>
# define sz(x) (int)((x).size())
#define inf 1000000000
#define cin in
#define cout out
const ll mod = 1000000007;
int n,m,a[100005],t[400005],x,y,z;
ifstream in("arbint.in");
ofstream out("arbint.out");
void build(int v,int l,int r){
	if(l==r){
		t[v]=a[l];
	}else{
		int mid=(l+r)/2;
		build(2*v,l,mid);
		build(2*v+1,mid+1,r);
		t[v]=max(t[2*v],t[2*v+1]);
	}
}
int get_max(int v,int tl,int tr,int l,int r){
	if(l>r)return 0;
	if(l==tl && r==tr)return t[v];
	int mid=(tl+tr)/2;
	return max(get_max(2*v,tl,mid,l,min(r,mid)),get_max(2*v+1,mid+1,tr,max(mid+1,l),r));
}
void update(int v,int l,int r,int pos,int val){
	if(l==r){
		t[v]=val;
	}else{
		int mid=(l+r)/2;
		if(pos<=mid)update(v*2,l,mid,pos,val);else update(v*2+1,mid+1,r,pos,val);
		t[v]=max(t[v*2],t[v*2+1]);
	}
}

int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(); cerr.tie(); cout.tie();
		cin>>n>>m;
	forn(i,1,n)cin>>a[i];
	build(1,1,n);
	while(m--){
		cin>>z>>x>>y;
		if(z==0){
			cout<<get_max(1,1,n,x,y)<<'\n';
		}else{
			update(1,1,n,x,y);
		}
	} 
return 0;
}