#include <stdio.h>
#include <fstream>
#include <assert.h>  
using namespace std;

#define in "arbint.in"
#define out "arbint.out"
#define dim 100001

int N, M;
int MaxArb[4*dim+66];

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

int query(int node, int st, int dr, int A, int B);
void update(int node, int st, int dr, int newVal, int pos);

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

	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 a, x, y;
		scanf("%d %d %d", &a, &x, &y);
		if (a == 0)
			printf("%d\n", query(1, 1, N, x, y));
		else
			update(1, 1, N, y, x);
	}

	return 0;
}

int query(int node, int st, int dr, int A, int B)
{
	if (st >= A && dr <= B)
		return MaxArb[node];

	int mid = (st + dr) >> 1, max = -1;
	
	if (A <= mid) max = query((node << 1), st, mid, A, B);
	if (B > mid) max = Maxim(max, query((node << 1) | 1, mid + 1, dr, A, B)); 
	return max;
}

void update(int node, int st, int dr, int newVal, int pos)
{
	if (st >= dr)
	{
		MaxArb[node] = newVal;
		return;
	}

	int mid = (st + dr) >> 1;
	if (pos <= mid)
		update(node << 1, st, mid, newVal, pos);
	else
		update((node << 1) | 1, mid + 1, dr, newVal, pos);
	MaxArb[node] = Maxim(MaxArb[node << 1], MaxArb[(node << 1) | 1]);
}