#include <fstream>

using namespace std;

int N, M, lol;
int v[100005];
int aint[271073];
ifstream fin ("arbint.in");

void Actualizare (int nod, int st, int dr, int a, int val)
{
	if (dr == st)
	{
		aint[nod] = val;
		return;
	}
	int mij = (st + dr) >> 1;
	if (a <= mij) Actualizare (nod << 1, st, mij, a, val);
	else Actualizare ((nod << 1) + 1, mij + 1, dr, a, val);
	aint[nod] = max (aint[nod << 1], aint[(nod << 1) + 1]);
}

int Interogare (int nod, int st, int dr, int a, int b)
{
	if (a <= st && b >= dr) return aint[nod];
	int mij = (st + dr) >> 1, S;
	if (a <= mij) S = Interogare (nod << 1, st, mij, a, b);
	if (b > mij) S = max (S, Interogare ((nod << 1) + 1, mij + 1, dr, a, b));
	return S;
}

void Citire () {
	fin >> N >> M;
	for (int i = 1; i <= N; i++)
	{
		fin >> v[i];
		Actualizare (1, 1, N, i, v[i]);
	}
}

void Business () {
	ofstream fout ("arbint.out");
	int a, b, val;
	for (int i = 0; i < M; i++)
	{
		fin >> val >> a >> b;
		if (val) Actualizare (1, 1, N, a, b);
		else fout << Interogare (1, 1, N, a, b) << "\n";
	}
	fin.close ();
	fout.close ();
}

int main () {
	Citire ();
	Business ();
	return 0;
}