#include <fstream>

using namespace std;

ifstream fin ("arbint.in");
ofstream fout("arbint.out");

const int dim = 100005;

int n, Q, x, q, w, sol;
int v[dim], a[4*dim];

void build(int nod, int st, int dr) {
    if (st == dr) {
        a[nod] = v[st];
        return;
    }
    int mid = st + (dr - st) / 2;
    build(2 * nod, st, mid);
    build(2 * nod + 1, mid + 1, dr);
    a[nod] = max(a[2*nod], a[2*nod+1]);
}

void query(int nod, int st, int dr, int q, int w) {
    if (q <= st && w >= dr) {
        sol = max(sol, a[nod]);
        return;
    }
    int mid = st + (dr - st) / 2;
    if (q <= mid)
        query(2 * nod, st, mid, q, w);
    if (w > mid)
        query(2 * nod + 1, mid + 1, dr, q, w);
}

void update(int nod, int st, int dr, int poz, int val) {
    if (st == dr) {
        a[nod] = val;
        return;
    }

    int mid = st + (dr - st) / 2;

    if (poz <= mid)
        update(2 * nod, st, mid, poz, val);
    else
        update(2 * nod + 1, mid + 1, dr, poz, val);

    a[nod] = max(a[2 * nod], a[2 * nod + 1]);
}

int main(){
    fin >> n >> Q;

    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    build(1, 1, n);

    for (int i = 1; i <= Q; i++) {
        fin >> x >> q >> w;

        if (x == 0) {
            sol = -12424;
            query(1, 1, n, q, w);
            fout << sol << '\n';
        }
        else
            update(1, 1, n, q, w);
    }
    return 0;
}