#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
const ll mod = 3e5 + 5;
ll n, k, m, mi, ma;

vector<ll> st(mod, 0);

void update(ll a, ll b, ll x, ll i, ll d){
	if(a == b && b == x){
		st[i] = d;
		return;
	}
	if(a > x || b < x) return;
	ll mid = (a + b)/2;
	update(a, mid, x, 2*i, d);
	update(mid + 1, b, x, 2*i + 1, d);
	st[i] = max(st[2*i], st[2*i + 1]);
}



ll get(ll a, ll b, ll x, ll y, ll i){
	if(a > y || b < x) return 0;
	if(x <= a && b <= y) return st[i];
	ll mid = (a + b)/2;
	ll z = get(a, mid, x, y, 2*i);
	z = max(z, get(mid + 1, b, x, y, 2*i + 1));
	return z;
}



void solve(){
	
	ifstream cin("arbint.in");
	ofstream cout("arbint.out");
	
	
	cin >> n >> m;
	ll c, x, y;
	for(int i = 0; i<n; i++){
		cin >> k;
		update(0, n - 1, i, 1, k);
	}
	for(int i = 0; i<m; i++){
		cin >> c >> x >> y;
		if(c == 0){
			x--; y--;
			cout << get(0, n - 1, x, y, 1) << "\n";
			continue;
		}
		x--;
		update(0, n - 1, x, 1, y);
	}
	
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t=1;
	//cin >> t;
	while(t--) solve();
	
	return 0;
}