#include <cstdio>
using namespace std;

int n, m, x, q_st, q_dr,poz, val;
int arb[100010 << 2];

int max(int a, int b)
{
	return a > b ? a : b;
}

void update(int nod, int st, int dr)
{
	if(st == dr)
		arb[nod] = val;
	else
	{
		int mid = st + ((dr - st) >> 1);
		
		if(poz <= mid)
			update((nod << 1), st, mid);
		else
			update((nod << 1)+1, mid+1, dr);

		arb[nod] = max(arb[nod << 1], arb[(nod << 1)+1]);
	}
}

int query(int nod, int st, int dr)
{
	if(q_dr < st || dr < q_st)
		return 0;
	else if(q_st <= st && dr <= q_dr)
		return arb[nod];
	
	int mid = st + ((dr - st) >> 1);
	return max( query((nod << 1), st, mid), query((nod << 1)+1, mid+1, dr) );
}

int main()
{

	freopen("arbint.in", "r", stdin);
	freopen("arbint.out", "w", stdout);

	scanf("%d%d", &n, &m);

	for(int i = 1; i <= n; ++i)
	{
		scanf("%d", &x);
		
		poz = i, val = x;
		update(1, 1, n);
	}

	while(m--)
	{
		scanf("%d%d%d", &x, &q_st, &q_dr);

		if(!x)
			printf("%d\n", query(1, 1, n));
		else
		{
			poz = q_st, val = q_dr;
			update(1, 1, n);
		}
	}

	return 0;
}