#include <cstdio>
#define max(a,b) (a > b ? a : b)

using namespace std;

const int nmx = 100002;

int n,m,a,b,cond;
int arb[4*nmx];

void update(int st, int dr, int pos){
    if(st == dr){
        arb[pos] = b;
        return;
    }

    int mij = st + (dr - st) / 2;

    if(a > mij)
        update(mij+1,dr,2*pos+1);
    else
        update(st,mij,2*pos);

    arb[pos] = max(arb[2*pos],arb[2*pos+1]);
}

int query(int st, int dr, int pos){
    if(st >= a && dr <= b)
        return arb[pos];
    int mij = st + (dr - st) / 2;
    int maxim = -1;
    if(a <= mij)
        maxim = max(maxim,query(st,mij,2*pos));
    if(b > mij)
        maxim = max(maxim,query(mij+1,dr,2*pos+1));
    return maxim;
}

int main(){
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    scanf("%d %d", &n, &m);
    for(a = 1; a <= n; ++a){
        scanf("%d", &b);
        update(1,n,1);
    }

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

    return 0;
}