#include <bits/stdc++.h>
using namespace std;

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

struct arbint{
    vector<int> tree;

    void update(int pos, int node, int left, int right, int value) {
        if (left == right) {
            tree[node] = value;
            return;
        }
        int mij = (left + right) / 2;
        if (pos <= mij) {
            update(pos, 2 * node, left, mij, value);
        } else {
            update(pos, 2 * node + 1, mij + 1, right, value);
        }
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }

    void query(int node, int req_left, int req_right, int left, int right,                                                                        int &maxim) {
        if (req_left <= left && right <= req_right) {
            maxim = max(maxim, tree[node]);
            return;
        }
        int mij = (left + right) / 2;
        if (mij >= req_left) {
            query(2 * node, req_left, req_right, left, mij, maxim);
        }
        if (mij < req_right) {
            query(2 * node + 1, req_left, req_right, mij + 1, right, maxim);
        }
    }
};

int main() {
    fin.tie(0)->sync_with_stdio(0);
    arbint aint; 
    int N, M; fin >> N >> M;
    int putere = 0;
    while ((1 << putere) <= 2 * N - 3) {
        putere++;
    }
    aint.tree.resize((1 << putere));
    for (int i = 0; i < N; ++i) {
        int x; fin >> x;
        aint.update(i, 1, 0, N - 1, x);
    }
    while (M--) {
        int cerinta, x, y; fin >> cerinta >> x >> y;
        if (cerinta == 1) {
            aint.update(x - 1, 1, 0, N - 1, y);
        } else {
            int maxim = -1;
            aint.query(1, x - 1, y - 1, 0, N - 1, maxim);
            fout << maxim << '\n';
        }
    }
    return 0;
}