#ifdef ONLINE_JUDGE
	#include <bits/stdc++.h>
#else
	#include <algorithm>
	#include <bitset>
	#include <cassert>
	#include <cmath>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <iostream>
	#include <map>
	#include <set>
	#include <stack>
	#include <string>
	#include <utility>
	#include <vector>
	#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int N, M;
vector <int> values, segment_tree;

void BuildSTree(int node = 1, int lefts = 1, int rights = N) {
	if (lefts == rights) {
		segment_tree[node] = values[lefts];
		return;
	}
	
	int mid;
	mid = (lefts + rights) / 2;
	BuildSTree(node * 2, lefts, mid);
	BuildSTree(node * 2 + 1, mid + 1, rights);
	
	segment_tree[node] = max(segment_tree[node * 2], segment_tree[node * 2 + 1]);
}

int QuerySTree(int a, int b, int node = 1, int lefts = 1, int rights = N) {
	
	if (a <= lefts && rights <= b) {
		return segment_tree[node];
	}
	
	int mid = (lefts + rights) / 2, r1 = 0, r2 = 0;
	if (a <= mid) {
		r1 = QuerySTree(a, b, node * 2, lefts, mid);
	}
	if (mid < b) {
		r2 = QuerySTree(a, b, node * 2 + 1, mid + 1, rights);
	}

	return max(r1, r2);
}

void UpdateSTree(int pos, int value, int node = 1, int lefts = 1, int rights = N) {
	if (lefts == rights) {
		segment_tree[node] = value;
		return;
	}
	
	int mid = (lefts + rights) / 2;
	if (pos <= mid) {
		UpdateSTree(pos, value, node * 2, lefts, mid);
	}
	else {
		UpdateSTree(pos, value, node * 2 + 1, mid + 1, rights);
	}
	segment_tree[node] = max(segment_tree[node * 2], segment_tree[node * 2 + 1]);
}

int main(){
	string file_input = "arbint";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, t, a, b;
	
	ReadNo(N); ReadNo(M);
	
	values.resize(N + 1);
	for (i = 1; i <= N; ++i) {
		ReadNo(values[i]);
	}
	
	for (i = 1; i <= N; i <<= 1);
	i <<= 1;
	segment_tree.resize(i + 1);
	
	BuildSTree(1, 1, N);
	
	for (i = 0; i < M; ++i) {
		ReadNo(t); ReadNo(a); ReadNo(b);
		if (t == 0) {
			printf("%d\n", QuerySTree(a, b));
		}
		else {
			UpdateSTree(a, b);
		}
	}
	
	return 0;
}