#include <cstdio>
#define max(a,b) (a > b ? a : b)
using namespace std;

const int nmx = 400002;
const int inf = 0x3f3f3f3f;

int n,m,a,b,arb[nmx],maxim;

void update(int nod, int st, int dr){
    if(st == dr){
        arb[nod] = b;
        return;
    }
    int m = st + (dr - st) / 2;
    if(m >= a)
        update(2*nod,st,m);
    else
        update(2*nod+1,m+1,dr);
    arb[nod] = max(arb[2*nod],arb[2*nod+1]);
}

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

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,1,n);
    }

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

    return 0;
}