#include <cstdio>
#include <algorithm>

using namespace std;

#define FILEIN "arbint.in"
#define FILEOUT "arbint.out"
#define NMAX 100005

int ArbInt[2*NMAX + 3];
int N, M, q;

void update(int nod, int l, int r, const int& pos, const int& val) {
    if ( l == r ) {
        ArbInt[nod] = val;
    } else {
        int m = (l+r)/2;
        if (pos <= m) {
            update(nod * 2, l, m, pos, val);
        } else {
            update(nod * 2 + 1, m+1, r, pos, val);
        }

        ArbInt[nod] = max(ArbInt[nod*2], ArbInt[nod*2+1]);
    }
}

void query(int nod, int l, int r, const int& a, const int& b) {
    if (a <= l && r <= b) {
        q = max(q, ArbInt[nod]);
        return;
    }

    int m = (l+r)/2;
    if (a <= m) {
        query(2*nod, l, m, a, b);
    }
    if (m < b) {
        query(2*nod+1, m+1, r, a, b);
    }
}

int main() {
    freopen(FILEIN, "r", stdin);
    freopen(FILEOUT, "w", stdout);

    scanf("%d %d", &N, &M);
    for ( int i = 1, x; i <= N; i++ ) {
        scanf("%d", &x);
        update(1, 1, N, i, x);
    }

    for ( int i = 1, x, a, b; i <= N; i++ ) {
        scanf("%d %d %d", &x, &a, &b);
        if (x) {
            update(1,1,N, a, b);
        } else {
            q = 0; query(1, 1, N, a, b);
            printf("%d\n", q);
        }
    }

    return 0;
}