#include<stdio.h>

int arb[1000000];

void update(int nod, int st, int dr, int pos, int val) {
    if (st == dr) {
        arb[nod] = val;
        return;
    } else {
        int mij = (st + dr) >> 1, fs = nod << 1, fd = (nod << 1) + 1;
        if (pos <= mij)
            update(fs, st, mij, pos, val);
        else
            update(fd, mij + 1, dr, pos, val);
    
        if (arb[fs] > arb[fd])
            arb[nod]=arb[fs];
        else
            arb[nod]=arb[fd];
    }
}

int query(int nod, int st, int dr, int a, int b) {
    if (a <= st && dr <= b)
        return arb[nod];
    else {
        int mij = (st + dr) >> 1, fs = nod << 1, fd = (nod << 1) + 1;
        int ml, mr;

        if (a <= mij)
            ml = query(fs, st, mij, a, b);
        if (b > mij)
            mr = query(fd, mij + 1, dr, a, b);

        return (ml > mr) ? ml : mr;
    }
}

int main() {
    int n, m, x, i, a, b;
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    scanf("%d%d", &n, &m);

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

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

    return 0;
}