#include <iostream>
#include <fstream>

using namespace std;

#define MAX 100000

int v[MAX], arb[MAX * 4];

void carb(int nod, int st, int dr) {
    if (st == dr) {
        arb[nod] = v[st];
    } else {
        int mid = (st + dr) / 2;

        carb(nod << 1, st, mid);
        carb((nod << 1) + 1, mid + 1, dr);

        arb[nod] = max(arb[nod << 1], arb[(nod << 1) + 1]);
    }
}

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

    int mid = (st + dr) >> 1;

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

    arb[nod] = max(arb[nod << 1], arb[(nod << 1) + 1]);
}

int query(int a, int b, int nod, int st, int dr) {
    if (a <= st && dr <= b) {
        return arb[nod];
    }

    if (st > b || dr < a) {
        return 0;
    }

    int mid = (st + dr) >> 1;

    int s = 0, d = 0;

    if (a <= mid) {
        s = query(a, b, nod << 1, st, mid);
    }

    if (b > mid) {
        d = query(a, b, (nod << 1) + 1, mid + 1, dr);
    }

    return max(s, d);
}

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

    int n, m, op, a, b;

    fin >> n >> m;

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

    carb(1, 1, n);

    for (int i = 0; i < m; i++) {
        fin >> op >> a >> b;

        if (op == 0) {
            fout << query(a, b, 1, 1, n) << "\n";
        } else {
            update(a, b, 1, 1, n);
        }
    }

    fin.close();
    fout.close();

    return 0;
}