#include <fstream>

using namespace std;

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

const int DIM = 100005;
int n, q;
int arr[DIM], segmentTree[DIM * 4];

void build(int node, int left, int right) {
    if (left == right) {
        segmentTree[node] = arr[left];
    } else {
        int mid = (left + right) / 2;
        build(node * 2, left, mid);
        build(node * 2 + 1, mid + 1, right);
        segmentTree[node] = max(segmentTree[node * 2], segmentTree[node * 2 + 1]);
    }
}

void update(int node, int left, int right, int pos, int val) {
    if (left == right) {
        segmentTree[node] = val;
    } else {
        int mid = (left + right) / 2;

        if (pos <= mid)
            update(node * 2, left, mid, pos, val);
        else
            update(node * 2 + 1, mid + 1, right, pos, val);

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

int query(int node, int left, int right, int qleft, int qright) {
    if (qleft <= left && right <= qright) {
        return segmentTree[node];
    } else {
        int mid = (left + right) / 2;

        if (qright <= mid)
            return query(node * 2, left, mid, qleft, qright);
        if (mid + 1 <= qleft)
            return query(node * 2 + 1, mid + 1, right, qleft, qright);
        return max(query(node * 2, left, mid, qleft, qright),
                   query(node * 2 + 1, mid + 1, right, qleft, qright));
    }
}

int main() {
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
        fin >> arr[i];

    build(1, 1, n);

    for (int i = 1; i <= q; i++) {
        int cmd, a, b;
        fin >> cmd >> a >> b;

        if (cmd == 0)
            fout << query(1, 1, n, a, b) << '\n';
        else
            update(1, 1, n, a, b);
    }

    return 0;
}