#include <cstdio>

int arb [1<<16], init [1<<16],x,y;

inline int max(int a, int b)
{
	if (a > b)
		return a;
	return b;
}

void construire(int st, int dr, int poz)
{
	if (st == dr)
		init [st] = poz;
	
	int mij = (st + dr)/2;
	
	construire (st, mij, 2*poz);
	construire (mij+1, dr, 2*poz+1);
}

void update(int poz, int val)
{
	int k = init [poz];
	arb [k] = val;
	
	for (k/=2; k > 0; k /= 2)
		arb [k] = max (arb [2*k], arb [2*k+1]);
}

int caut(int st, int dr, int poz)
{
	if (x <= st && dr <= y)
		return arb [poz];
	if (dr < x || st > y)
		return 0;
	int mij = (st + dr)/2;
	return max (caut(st,dr,2*poz), caut (mij+1,dr,2 * poz + 1));	
}

int main()
{
	int n,m,nr;
	freopen ("Arbore.in","r",stdin);
	freopen ("Arbore.out","w",stdout);
	scanf ("%d%d",&n,&m);
	construire (1, n, 1);
	for (int i = 1; i <= n; ++i)
	{
		scanf ("%d",&nr);
		update (i, nr);
	}
	
	/*Citim operatiile.
	0 -> adaugam un element;
	1 -> afisam maximul pe un interval;
	*/
	
	int tip;
	
	for (int i = 1; i <= m; ++i)
	{
		scanf ("%d%d%d", &tip, &x, &y);
		
		if (tip == 0)
			update (x, y);
		else
			printf ("%d\n",caut (x,y,1));
	}
	
	return 0;
}