#include <bits/stdc++.h>

using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

const int NMAX = 100003;
int N, M, x, cer, arg1, arg2, a[NMAX * 4];

void update(int nod, int st, int dr, int poz, int val);
int query(int nod, int st, int dr, int x, int y);

int main() {
    f >> N >> M;
    for(int i = 1; i <= N; i++) {
        f >> x;
        update(1, 1, N, i, x);
    }
    for(int i = 1; i <= M; i++) {
        f >> cer >> arg1 >> arg2;
        if(cer == 0) {
            g << query(1, 1, N, arg1, arg2) << "\n";
        } else {
            update(1, 1, N, arg1, arg2);
        }
    }
    return 0;
}

void update(int nod, int st, int dr, int poz, int val) {
    if(st == dr) a[nod] = val;
    else {
        int mij = (st + dr) / 2;
        if(poz <= mij) update(nod * 2, st, mij, poz, val);
        else update(nod * 2 + 1, mij + 1, dr, poz, val);
        a[nod] = max(a[nod * 2], a[nod * 2 + 1]);
    }
}

int query(int nod, int st, int dr, int x, int y) {
    if(x <= st && y >= dr) return a[nod];
    else {
        int mij = (st + dr) / 2, cmmdc1 = -1, cmmdc2 = -1;
        if(x <= mij) cmmdc1 = query(nod * 2, st, mij, x, y);
        if(y > mij) cmmdc2 = query(nod * 2 + 1, mij + 1, dr, x, y);
        if(cmmdc1 == -1) return cmmdc2;
        else if(cmmdc2 == -1) return cmmdc1;
        else return max(cmmdc1, cmmdc2);
    }
}