/* Time complexity: O (N * sqrt(N)) */

#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#define in "arbint.in"
#define out "arbint.out"
#define dim 100000

int max(int a, int b) {
	return a > b ? a : b;
}

int N, M, X, Y, size;
int T[dim], A[dim];

void Update(){
	A[--X] = Y;
	T[X / size] = -1;
	int l = X - (X % size);
	for (int i = l; i <= l + size - 1; ++i) T[X / size] = max(T[X / size], A[i]);
}

int Query() {
	--X, --Y;
	int Max = -1, l = (X + size - 1) / size, r = (Y - size + 1) / size, i;
	if ((Y - size + 1) < 0) r = -1;

	for (i = l; i <= r; ++i) Max = max(Max, T[i]);
	for (i = X; i % size && i <= Y; ++i) Max = max(Max, A[i]);
	for (i = Y; (i + 1) % size && i >= X; --i)Max = max(Max, A[i]);

	return Max;
}

int main(){
	freopen(in, "r", stdin);
	freopen(out, "w", stdout);

	scanf("%d %d", &N, &M);
	for (size = 1; size * size <= N; ++size);
	--size;
	for (int i = 0; i < N; ++i)
		scanf("%d", &A[i]),
		T[i / size] = max(T[i / size], A[i]);

	for (int type; M; --M){
		scanf("%d %d %d", &type, &X, &Y);
		if (type) Update();
		else printf("%d\n", Query());
	}
	return 0;
}