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

ifstream f("arbint.in");
ofstream g("arbint.out");
#define cin f
#define cout g

int aInt[500000], n, m, x, op, y;

void update(int nod, int left, int right, int poz, int val) {
    if(left == right) {
        aInt[nod] = val;
        return;
    }
    int mij = (left + right) / 2;
    if(mij >= poz)
        update(nod * 2, left, mij, poz, val);
    else 
        update(nod * 2 + 1, mij + 1, right, poz, val);
    aInt[nod] = max(aInt[nod * 2], aInt[nod * 2 + 1] );
}

int query(int nod, int left, int right, int a, int b) {
    if(a > right || b < left) return -1;
    if( a <= left && right <= b ) return aInt[nod];
    int mij = (left + right) / 2;
    return max(query(nod * 2, left, mij, a, b), query(nod * 2 + 1, mij + 1, right,  a, b));
}

int main() {
    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        cin >> x;
        update(1, 1, n, i + 1, x);
    }
    for(int i = 0; i < m; i++) {
        cin >> op >> x >> y;
        if(op == 0)
            cout << query(1, 1, n, x, y) << "\n";
        else 
            update(1, 1, n, x, y);
    }
}