#include <fstream>
#include <iostream>
#include <complex>
#include <iomanip>
#include <string>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <cstdlib>
using namespace std;
//```
#define ONLINE_JUDGE
const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long
#define MOD1 666013
#define MOD2 666019
#define base 73
typedef stack<int> si;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;
#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end())
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)
si stk;
vi arb;
int N, M;
void add(int node, int lf, int rg, int pos, int val);
void get(int node, int lf, int rg, int a, int b);
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#else
freopen("arbint.in", "r", stdin);
freopen("arbint.out", "w", stdout);
#endif
int i, x, a, b, c;
scanf("%d %d", &N, &M);
arb.resize(N * 3 / 2);
for (i = 0; i < N; ++i) {
scanf("%d", &x);
add(1, 0, N - 1, i, x);
// for (int i = 0; i < 10; ++i) {
// printf("%d ", arb[i]);
// }
// printf("\n");
}
for (i = 0; i < M; ++i) {
scanf("%d %d %d", &c, &a, &b);
if (c == 0) {
get(1, 0, N, a - 1, b - 1);
printf("%d\n", stk.top());
stk.pop();
}
else {
add(1, 0, N, a - 1, b);
}
}
return 0;
}
void add(int node, int lf, int rg, int pos, int val) {
if (lf == rg) {
arb[node] = val;
}
else {
int mid = (lf + rg) / 2;
if (pos <= mid) {
add(node * 2, lf, mid, pos, val);
}
else {
add(node * 2 + 1, mid + 1, rg, pos, val);
}
arb[node] = max(arb[node * 2], arb[node * 2 + 1]);
}
}
void get(int node, int lf, int rg, int a, int b) {
if (a <= lf && rg <= b) {
//printf("%d %d %d\n", node, a, b);
stk.push(arb[node]);
}
else {
int mid = (lf + rg) / 2;
if (a <= mid) {
get(node * 2, lf, mid, a, b);
}
else if (mid < b){
get(node * 2 + 1, mid + 1, rg, a, b);
}
int v1, v2;
if (sz(stk) > 1) {
v1 = stk.top(); stk.pop();
v2 = stk.top(); stk.pop();
stk.push(max(v1, v2));
}
}
}