#include <cstdio>
#include <algorithm>
#define NMAX 100009
#define oo (1<<30)
using namespace std;
int N, Q, aint[ 4 * NMAX ];
void update(int node, int st, int dr, int a, int b, int val){
if (st == dr) {
aint[ node ] = val;
return;
}
int left = node << 1, right = left + 1;
int mij = (st + dr) >> 1;
if (a <= mij) {
update(left, st, mij, a, b, val);
} else {
update(right, mij + 1, dr, a, b, val);
}
aint[ node ] = aint[ left ] > aint[ right ] ? aint[ left ] : aint[ right ];
}
int query(int node, int st, int dr, int a, int b){
if (a <= st && dr <= b) {
return aint[ node ];
}
int left = node << 1, right = left + 1;
int mij = (st + dr) >> 1;
int sol = -oo;
if (a <= mij) {
sol = max(sol, query(left, st, mij, a, b) );
}
if (mij < b) {
sol = max(sol, query(right, mij + 1, dr, a, b) );
}
return sol;
}
int main() {
freopen("arbint.in", "r", stdin);
freopen("arbint.out", "w", stdout);
scanf("%d%d", &N, &Q);
for (int i = 1; i <= N; ++i) {
int val;
scanf("%d", &val);
update(1, 1, N, i, i, val);
}
while (Q--) {
int op, a, b, poz, val;
scanf("%d", &op);
if (!op) {
scanf("%d%d", &a, &b);
printf("%d\n", query(1, 1, N, a, b) );
} else {
scanf("%d%d", &poz, &val);
update(1, 1, N, poz, poz, val);
}
}
return 0;
}