#include<cstdio>
#include<cstdlib>

using namespace std;

char *buffer;
int AINT[1 << 18];

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

void update(int nod, int start, int stop, int poz, int val)
{
	int med;
	
	if(start == stop){
		AINT[nod] = val;
		return;
	}
	
	med = (start + stop) >> 1;
	
	if(poz <= med)
		update(nod << 1, start, med, poz, val);
	else
		update((nod << 1) + 1, med + 1, stop, poz, val);
	
	AINT[nod] = maxim(AINT[nod << 1], AINT[(nod << 1) + 1]);
}

int query(int nod, int start, int stop, int st, int dr)
{
	int med, sol1 = 0, sol2 = 0;
	
	if(st <= start && stop <= dr)
		return AINT[nod];
	
	med = (start + stop) >> 1;
	
	if(st <= med)
		sol1 = query(nod << 1, start, med, st, dr);
	if(med < dr)
		sol2 = query((nod << 1) + 1, med + 1, stop, st, dr);
	
	return maxim(sol1, sol2);
}

void read(int &x)
{
	while((*buffer < '0') || (*buffer > '9'))
		++buffer;
	
	x = 0;
	
	while((*buffer >= '0') && (*buffer <= '9')){
		x = ((x * 10) + (*buffer - '0'));
		++buffer;
	}
}

int main()
{
	freopen("arbint.in", "r", stdin);
	freopen("arbint.out", "w", stdout);
	
	int N, M, i, x, y, tip, fs;
	
	fseek(stdin, 0, SEEK_END);
	fs = ftell(stdin);
	buffer = (char*) malloc(fs);
	rewind(stdin);
	fread(buffer, 1, fs, stdin);
	
	//in >> N >> M;
	//scanf("%d %d", &N, &M);
	read(N), read(M);
	
	for(i = 1; i <= N; i ++){
		//in >> x;
		//scanf("%d", &x);
		read(x);
		update(1, 1, N, i, x);
	}
	
	while(M--){
		//in >> tip >> x >> y;
		//scanf("%d %d %d", &tip, &x, &y);
		read(tip), read(x), read(y);
		
		if(tip)
			update(1, 1, N, x, y);
		else
			//out << query(1, 1, N, x, y) << "\n";
			printf("%d\n", query(1, 1, N, x, y));
	}
	
	return 0;
}