#include <cstdio>

const int MAX_N(100000);
const int MAX_SIZE(MAX_N * 4);

int v [MAX_N];
int it [MAX_SIZE];

int n, m;

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

inline int left_son (int index)
{
	return index << 1;
}

inline int right_son (int index)
{
	return (index << 1) + 1;
}

void build (int index, int left, int right)
{
	if (left == right)
	{
		it[index] = v[left];
		return;
	}
	int middle((left + right) >> 1);
	build(left_son(index),left,middle);
	build(right_son(index),middle + 1,right);
	it[index] = max(it[left_son(index)],it[right_son(index)]);
}

void update (int index, int left, int right, int position, int value)
{
	if (left == right)
	{
		it[index] = value;
		return;
	}
	int middle((left + right) >> 1);
	if (position <= middle)
		update(left_son(index),left,middle,position,value);
	else
		update(right_son(index),middle + 1,right,position,value);
	it[index] = max(it[left_son(index)],it[right_son(index)]);
}

int query (int index, int left, int right, int ql, int qr)
{
	if (ql <= left && right <= qr)
		return it[index];
	int result(0), middle((left + right) >> 1);
	if (ql <= middle)
		result = max(result,query(left_son(index),left,middle,ql,qr));
	if (qr > middle)
		result = max(result,query(right_son(index),middle + 1,right,ql,qr));
	return result;
}

int main (void)
{
	std::freopen("arbint.in","r",stdin);
	std::freopen("arbint.out","w",stdout);
	std::scanf("%d %d",&n,&m);
	for (int i(1) ; i <= n ; ++i)
		std::scanf("%d",&v[i]);
	build(1,1,n);
	int o, a, b;
	while (m)
	{
		std::scanf("%d %d %d",&o,&a,&b);
		if (o == 0)
			std::printf("%d\n",query(1,1,n,a,b));
		else
			update(1,1,n,a,b);
		--m;
	}
	std::fclose(stdin);
	std::fclose(stdout);
	return 0;
}