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

#define NX 100010
#define SQRTNX 320
int a[NX], b[SQRTNX], rightPos[SQRTNX], leftPos[SQRTNX];

inline int maxim(int left, int right) 
{
	int max = a[left];
	for (int i = left + 1; i <= right; i++) 
	{
		if (max < a[i])
			max = a[i];
	}

	return max;
}

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

int sqrtMax(int left, int right, int sqrtN, int N)
{
	if (left - right < sqrtN) 
	{
		return maxim(left, right);
	}

	int max = -1;
	// interior
	for (int i = 1; i < sqrtN; i++) 
	{
		if (left < leftPos[i] && right > rightPos[i])
		{
			max = MaximTwoElems(max, b[i]);
		} else if (right < rightPos[i]) {
			break;
		}
	}

	int bLeftRem = left % sqrtN;
	int bRightRem = right % sqrtN; 
	max = a[left] > a[right] ? a[left] : a[right];

	// left remainder
	if (bLeftRem != 1) 
	{
		max = maxim(left, (sqrtN - bLeftRem) + left + 1);
	}

	// right remainder
	if (bRightRem != 0) 
	{
		max = maxim(right - bRightRem, right);
	}

	return max;
}

int main() 
{
	int N, M, op, an, bn, j = 1;
	freopen("arbint.in", "r", stdin);
	freopen("arbint.out", "w", stdout);

	scanf("%d %d", &N, &M);

	int sqrtN = 1;
	while (sqrtN * sqrtN < N) 
	{
		sqrtN++;
	}
	sqrtN--;
	int left = 1;

	for (int i = 1; i <= N; i++) 
	{
		scanf("%d", &a[i]);
		if (i == N) 
		{
			b[j] = maxim(left, i);
			j++;
		}
		else {
			if (i % sqrtN == 0) {
				b[j] = maxim(left, i);
				leftPos[j] = left;
				rightPos[j] = i;

				j++;

				left = i + 1;
			}
		}
	}

	for (int i = 1; i <= M; i++)
	{
		scanf("%d %d %d\n", &op, &an, &bn);

		switch (op)
		{
		case 0:
			printf("%d\n", sqrtMax(an, bn, sqrtN, N));
			break;
		case 1:
			a[an] = bn;
			int bi = 1, left = 1, right = sqrtN;
			for (int i = 1; i < sqrtN; i++)
			{
				if (an >= leftPos[i] && an <= rightPos[i]) 
				{
					bi = i;
					left = leftPos[i];
					right = rightPos[i];
				}
			}
			b[bi] = maxim(left, right);
			break;
		}
	}
}