#include <iostream>

using namespace std;


#define maxN 100010


int Aint[maxN * 3], maxim;


void update (int nod, int st, int dr, int val, int poz)
{
	if (st == dr)
	{
		Aint[nod] = val;
		return;
	}
	
	int mid = (st + dr) / 2;
	
	if (poz <= mid) update (nod * 2, st, mid, val, poz);
	else update (nod * 2 + 1, mid + 1, dr, val, poz);
	
	Aint[nod] = max (Aint[nod * 2], Aint[nod * 2 + 1]);
}



void query (int nod, int st, int dr, int A, int B)
{
	if (A <= st && B >= dr)
	{
		maxim = max (maxim, Aint[nod]);
		return;
	}
	
	int mid = (st + dr) / 2;
	
	if (A <= mid) query (nod * 2, st, mid, A, B);
	if (mid < B) query (nod * 2 + 1, mid + 1, dr, A, B);
}



int main()
{
	freopen ("arbint.in", "r", stdin);
	freopen ("arbint.out", "w", stdout);
	
	int N, M;
	
	scanf ("%d %d", &N, &M);
	
	for (int i = 1; i <= N; ++ i)
	{
		int val;
		
		scanf ("%d", &val);
		
		update (1, 1, N, val, i);
	}
	
	
	for (int i = 1; i <= M; ++ i)
	{
		int type, a, b;
		maxim = -1;
		
		scanf ("%d %d %d", &type, &a, &b);
		
		if (! type) query (1, 1, N, a, b), printf ("%d\n", maxim);
		else update (1, 1, N, b, a);
	}
	
	
	return 0;
}