#include <fstream>

using namespace std;

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

const int N = 1000001;
int n, m;
int tree[4 * N];

void update(int node, int left, int right, int pos, int val) {
    if (left == right) {
        tree[node] = val;
        return;
    }

    int mid = left + (right - left) / 2;

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

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

int query(int node, int left, int right, int L, int R) {
    if (L <= left && right <= R) {
        return tree[node];
    }

    int mid = left + (right - left) / 2;
    int maxVal = -1;

    if (L <= mid) {
        maxVal = max(maxVal, query(node * 2, left, mid, L, R));
    } else {
        maxVal = max(maxVal, query(node * 2 + 1, mid + 1, right, L, R));
    }

    return maxVal;
}

int main() {
    int op, a, b;

    fin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        fin >> a;
        update(1, 1, n, i, a);
    }

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

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

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

    return 0;
}