#include <bits/stdc++.h>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

const int DIM = 1e5 + 1;

int v[DIM];
int arb[DIM * 4];

void get(int pos)
{
	arb[pos] = max(arb[pos * 2], arb[pos * 2 + 1]);
}

void build(int pos, int l, int r)
{
	if(l == r)
	{
		arb[pos] = v[l];
		return ;
	}

	int mid = (l + r) / 2;

	build(pos * 2, l, mid);
	build(pos * 2 + 1, mid + 1, r);

	get(pos);
}

void update(int pos, int l, int r, int x, int y)
{
	if(l == r)
	{
		arb[pos] = y;
		return ;
	}

	int mid = (l + r) / 2;

	if(x <= mid)
		update(pos * 2, l, mid, x, y);
	else
		update(pos * 2 + 1, mid + 1, r, x, y);

	get(pos);
}

int query(int pos, int l, int r, int x, int y)
{
	if(x <= l && r <= y)
	{
		return arb[pos];
	}

	int ans = 0;

	int mid = (l + r) / 2;

	if(x <= mid)
		ans = max(ans, query(pos * 2, l, mid, x, y));

	if(y > mid)
		ans = max(ans, query(pos * 2 + 1, mid + 1, r, x, y));

	return ans;
}

main()
{
	int n, m;
	fin >> n >> m;

	for(int i = 1; i <= n; ++i)
		fin >> v[i];

	build(1, 1, n);

	for(; m; --m)
	{
		int op, x, y;
		fin >> op >> x >> y;

		if(op == 0)
		{
			fout << query(1, 1, n, x, y) << '\n';
		}
		else
		{
			update(1, 1, n, x, y);
		}
	}
}