#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#include <stdlib.h>
#define MAXN 100001

using namespace std;

int N, M, Val, maxx, MaxVal[4 * MAXN];

inline int max(int x, int y) { return x > y ? x : y; }

void update(int node, int left, int right, int pos)
{
	if (left == right){
		MaxVal[node] = Val;
		return;
	}
	int mid = (left + right) / 2;
	if (pos <= mid) update(node * 2, left, mid, pos);
	else update(node * 2 + 1, mid + 1, right, pos);

	MaxVal[node] = max(MaxVal[node * 2], MaxVal[node * 2 + 1]);
}

void query(int node, int left, int right, int a, int b)
{
	if (a <= left && b >= right){
		maxx = max(MaxVal[node], maxx);
		return;
	}
	int mid = (left + right) / 2;
	if (a <= mid) query(node * 2, left, mid, a, b);
	if (b >= mid + 1) query(node * 2 + 1, mid + 1, right, a, b);
}

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

	scanf("%d %d", &N, &M);
	for (int i = 1; i <= N; i++)
		scanf("%d", &Val),
		update(1, 1, N, i);
	for (int i = 1, x, a, b; i <= M; i++, maxx = 0){
		scanf("%d %d %d", &x, &a, &b);
		if (!x) query(1, 1, N, a, b),
			printf("%d\n", maxx);
		else Val = b, update(1, 1, N, a);
	}
	return 0;
}