#include <iostream>
#include <fstream>

using namespace std;

const int MAXN = 100010;
int tree[2 * MAXN], n, q;
ifstream fin("arbint.in");
ofstream fout("arbint.out");

int doMax(int a, int b) {
    return (a > b ? a : b);
}

void updateTree(int node, int left, int right, int pos, int value) {
    if (left == right) {
        tree[node] = value;
        return;
    }
    int middle = (left + right) >> 1;
    if (pos <= middle)
        updateTree(node * 2, left, middle, pos, value);
    else
        updateTree(node * 2 + 1, middle + 1, right, pos, value);
    tree[node] = doMax(tree[node * 2], tree[node * 2 + 1]);
}

int query(int node, int left, int right, int start, int finish) {
    if (start <= left && finish >= right)
        return tree[node];
    int middle = (left + right) >> 1, result1 = 0, result2 = 0;
    if (start <= middle)
        result1 = query(node * 2, left, middle, start, finish);
    if (finish > middle)
        result2 = query(node * 2 + 1, middle + 1, right, start, finish);
    return doMax(result1, result2);
}

int main() {
    int x, y, nr;
    fin >> n >> q;
    for (int i = 1; i <= n; i++) {
        fin >> x;
        updateTree(1, 1, n, i, x);
    }
    for (int i = 1; i <= q; i++) {
        fin >> nr >> x >> y;
        if (nr == 0)
            fout << query(1, 1, n, x, y) << "\n";
        else
            updateTree(1, 1, n, x, y);
    }
    return 0;
}