#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100000 + 1;
int n, q, a, b, valoare, poz, sol;
int arb[4 * NMAX];

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

void query(int nod, int st, int dr) {
    if (a <= st && dr <= b) sol = max(sol, arb[nod]);
    else {
        int m = (st + dr) / 2;
        if (a <= m) query(2 * nod, st, m);
        if (m < b) query(2 * nod + 1, m + 1, dr);
    }
}

void citeste() {
    f >> n >> q;
    for (int i = 1; i <= n; i++) {
        f >> valoare; poz = i;
        update(1, 1, n);
    }
}

void rezolva() {
    int tip;
    while (q--) {
        f >> tip >> a >> b;
        if (tip == 1) {
            poz = a; valoare = b;
            update(1, 1, n);
        }
        else {
            sol = -1;
            query(1, 1, n);
            g << sol << '\n';
        }
    }
}

int main() {
    citeste();
    rezolva();
    return 0;
}