#include <stdio.h>
const int n_max = 100001;
int arb[2*n_max];
int n, i, a, b, c, t, m;
inline int max (int a, int b)
{
	if (a < b)
		return b;
	return a;
}

void update(int val, int pos, int l, int r, int o)
{
	if (l == r)
	{
		arb[o] = val;
		return;
	}
	int m = (l+r)/2;
	if (pos <= m)
		update(val, pos,l, m, 2*o);
	else
		update(val, pos,  m+1, r, 2*o+1);
	arb[o] = max(arb[2*o], arb[2*o+1]);
}
int query(int a, int b, int l, int r, int o)
{
	int s = -1;
	if (a <= l && r <= b)
		return arb[o];
	int m = (l+r)/2;
	if (a <= m)
		s = max(s, query(a, b, l, m, 2*o));
	if (b > m)
		s = max(s, query(a, b, m+1, r, 2*o+1));
	return s;
}
int main()
{
	freopen("arbint.in","r",stdin);
	freopen("arbint.out","w",stdout);
	scanf("%d %d", &n, &m);
	for (i = 1; i<= n; ++ i)
	{
		scanf("%d", &t);
		update(t, i, 1, n, 1);
	}
	for (i = 1; i <= m; ++ i)
	{
		scanf("%d %d %d", &c, &a, &b);
		if (c == 0)
			printf("%d\n", query(a, b, 1, n, 1));
		else
			update(b, a, 1, n, 1);
	}
	return 0;
}