#include <fstream>
#define DIM 100006

using namespace std;

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

int n, q, v[DIM];
int aint[4 * DIM];

void build(int node, int st, int dr) {
    if (st == dr) {
        aint[node] = v[st];
        return ;
    }

    int mid = (st + dr) / 2;
    build(2 * node, st, mid);
    build(2 * node + 1, mid + 1, dr);

    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void update(int node, int st, int dr, int pos, int value) {
    if (st == dr) {
        aint[node] = value;
        return ;
    }

    int mid = (st + dr) / 2;
    if (pos <= mid) {
        update(2 * node, st, mid, pos, value);
    } else {
        update(2 * node + 1, mid + 1, dr, pos, value);
    }

    aint[node] = max(aint[2 *  node], aint[2 * node + 1]);
}

int query(int node, int st, int dr, int stQ, int drQ) {
    if (stQ <= st && dr <= drQ) {
        return aint[node];
    }

    int mid = (st + dr) / 2, r1(0), r2(0);
    if (stQ <= mid) {
        r1 = query(2 * node, st, mid, stQ, drQ);
    }
    if (mid < drQ) {
        r2 = query(2 * node + 1, mid + 1, dr, stQ, drQ);
    }

    return max(r1, r2);
}


int main() {
    f >> n >> q;

    for (int i = 1; i <= n; i++)
        f >> v[i];

    build(1, 1, n);

    for (; q--; ) {
        int op, x, y;
        f >> op >> x >> y;
        if (op == 1) {
            update(1, 1, n, x, y);
        } else {
            g << query(1, 1, n, x, y) << "\n";
        }
    }

    return 0;
}