#include <stdlib.h>
#include <stdio.h>
#include <math.h>

int get_max(int *maxi, int pos, int l, int r, int x, int y)
{
	int mid = (l+r)/2;
	int m1, m2;

	if(x == l && y == r)
		return maxi[pos];
	//go left
	if(x >= l && y <= mid)
		return get_max(maxi, 2 * pos, l, mid, x, y);

	//go right
	if (x >= mid + 1 && y <= r)
		return get_max(maxi, 2 * pos + 1, mid +1, r, x, y);

	// x is on left side, y is on right side
	m1 = get_max(maxi, 2 * pos, l, mid, x, mid);
	m2 = get_max(maxi, 2 * pos + 1, mid + 1, r, mid + 1, y);
	
	if (m1 > m2)
		return m1;
	else 
		return m2;

	return -1;
		
}

void update(int* maxi, int pos, int l, int r, int idx, int val)
{
	int mid = (l + r) / 2;

	if (l == r) {
		maxi[pos] = val;
		//printf("max[%d..%d] = %d\n", idx, idx, val);
		return;
	}

	if (idx >= l && idx <= mid)
		update(maxi, pos * 2, l, mid, idx, val);

	if (idx >= mid + 1 && idx <= r)
		update(maxi, pos*2 + 1, mid + 1, r, idx, val);

	if (maxi[pos * 2] > maxi[pos * 2 + 1])
		maxi[pos] = maxi[pos * 2];
	else 
		maxi[pos] = maxi[pos * 2 +1];
	
	//printf("max[%d..%d] = %d\n", l, r, maxi[pos]);
	return;

}
int maxi_get_size(int n)
{
	for (int i = 0; i <= 31; i++) {
		int x = 0x1 << i;
		if(x >= n)
			return x;
	}

	return -1;
}

int main()
{
	FILE *infile, *outfile;
	int m, n, i, j, op, size;
	int* maxi;

	infile = fopen("arbint.in", "r");
	outfile = fopen("arbint.out", "w");
	fscanf(infile, "%d %d", &n, &m);
	
	size = maxi_get_size(2 * n - 1);
	maxi = malloc((size + 1) * sizeof(int));
	for (i = 0; i <= size; i++)
		maxi[i] = 0;

	for(i = 1; i <= n; i++) {
		int value;
		fscanf(infile, "%d", &value);
		update(maxi, 1, 1, n, i, value);
	}
	for (i = 0; i < m; i++) {
		int y, x, value;
		fscanf(infile,"%d", &op);
		fscanf(infile, "%d %d", &x, &y);
		if(op == 0) {
			value = get_max(maxi, 1, 1, n, x, y);
			fprintf(outfile, "%d\n", value);
		} else {
			update(maxi, 1, 1, n, x, y);
		}

	}
	return 0;
}