#include<iostream>
#include<vector>
#include<fstream>

#define dim 100001
using namespace std;

inline int Maxim(int a, int b){
	if (a > b) return a;
	return b;
}

ifstream f("arbint.in", ios::in);
ofstream g("arbint.out", ios::out);

int N, M;
int MaxArb[4*dim+66];
int start, finish, Val, Pos, maxim;

void Update(int,int,int);
void Query(int,int,int);

int main(){
	
	int X, A, B;
	f >> N >> M;
	for (int i = 1; i <= N; i++){
		f >> X;
		Pos = i; Val = X;
		Update(1, 1, N);
	}

	for (int i = 1; i <= M; i++){
		f >> X >> A >> B;
		if (X == 0){
			maxim = -1;
			start = A, finish = B;
			Query(1, 1, N);
			g << maxim << endl;
		}
		else{
			Pos = A, Val = B;
			Update(1, 1, N);

		}
	}
	

	f.close();
	g.close();
	return 0;
}


void Update(int nod,int left,int right){
	if (left == right){
		MaxArb[nod] = Val;
		return;
	}

	int div = (left + right) / 2;
	if (Pos <= div)		Update(2*nod,left,div);
	else				Update(2*nod+1,div+1,right);

	MaxArb[nod] = Maxim(MaxArb[2*nod],MaxArb[2*nod+1]);
	
}

void Query(int nod,int left, int right){

	if (start <= left && right <= finish){
		if (maxim < MaxArb[nod]) maxim = MaxArb[nod];
		return;
	}

	int div = (left + right) / 2;
	if (start <= div) Query(2 * nod, left, div);
	if (div < finish) Query(2 * nod + 1, div + 1, right);
}