#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>
#define max(a, b) (a > b? a: b)

int s[18][100352], n, l;



int log2(int n)
{
	int l = 0, p = 1;
	while (n > p)
	{
		p <<= 1;
		l++;
	}
	return l;
}


int queryLeft(int st, int dr)
{
	if (st > dr)
		return 0;

	if (st == dr)
		return s[0][st];

	int l = log2(dr - st + 1) - 1;
	return max(s[l][dr >> l], queryLeft(st, ((dr >> l) << l) - 1));
}


int queryRight(int st, int dr)
{
	if (st > dr)
		return 0;

	if (st == dr)
		return s[0][st];

	int l = log2(dr - st + 1) - 1;
	return max(s[l][st >> l], queryRight(((st >> l) + 1) << l, dr));
}


int query(int st, int dr)
{
	if (st == dr)
		return s[0][st];

	int l = log2(dr - st + 1) - 1;
	int t = (dr >> l) << l;
	return max(queryLeft(st, t - 1), queryRight(t, dr));
}


void update(int pos, int val)
{
	s[0][pos] = val;

	for (int temp, i = 1; i <= l; i++)
	{
		temp = pos << (i - 1);
		s[i][pos << i] = max(s[i - 1][temp], s[i - 1][temp + 1]);
	}
}


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

	int m, i, j;
	scanf("%d%d", &n, &m);

	l = log2(n);
	for (i = 0; i < n; i++)
	{
		scanf("%d", &j);
		update(i, j);
	}


	for (j = 0; j < m; j++)
	{
		int o, a, b;
		scanf("%d%d%d", &o, &a, &b);

		if (o == 0)
			printf("%d\n", query(a - 1, b - 1));
		else
			update(a - 1, b);		
	}

	return 0;
}