#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int n, m;
int v[100001];
int H[300003];

inline void update(int node, int left, int right, int poz, int val)
{
	if ( left >= right )
	{
		H[node]=val;
		return;
	}
	int middle=(left+right)>>1;
	if (poz <= middle)
		update(2*node, left, middle, poz, val);
	else
		update(2*node+1, middle+1, right, poz, val);
	H[node]=max(H[2*node], H[2*node+1]);
}

inline int query(int node, int left, int right, int i, int j)
{
	if ( i <= left && right <= j)
		return H[node];
	
	int middle=(left+right)>>1;
	int sol=-1;
	
	if ( i <= middle)
		sol=max(sol, query(2*node, left, middle, i, j));
	if ( middle < j)
		sol=max(sol, query(2*node+1, middle+1, right, i, j));
	
	return sol;
}

void solve()
{
	fstream f("arbint.in", ios::in);
	fstream g("arbint.out", ios::out);
	f>>n>>m;
	for (int i=1; i<=n; ++i)
	{
		f>>v[i];
		update(1, 1, n, i, v[i]);
	}
	int dec, a, b;
	for (int j=1; j<=m; ++j)
	{
		f>>dec>>a>>b;
		if (dec == 0)
			g<<query(1, 1, n, a, b)<<"\n";
		
		if (dec == 1)
		{
			update(1, 1, n, a, b);
			v[a]=b;
		}
	}
	f.close();
	g.close();
}

int main()
{
	solve();
};