#include <cstdio>
using namespace std;

struct arbore{int info; arbore *st, *dr;} *arb;
int m, n, maxim;

void actualizare(arbore *&nod, int a, int b, int poz, int val)
{
    if(nod == NULL){
        nod = new arbore;
        nod->info = 0;
        nod->st = nod->dr = NULL;
    }
    if(a==b){
        nod->info = val;
    }
    else{
        int mij = (a+b)/2;
        if(poz <= mij) actualizare(nod->st, a, mij, poz, val);
        else actualizare(nod->dr, mij+1, b, poz, val);

        int x = (nod->st!=NULL ? nod->st->info : 0), y = (nod->dr!=NULL ? nod->dr->info : 0);
        nod->info = (x <= y ? y : x);
    }
}

void interogare(arbore *nod, int st, int dr, int a, int b){
    if(a <= st && dr <= b)
        maxim = (maxim <= nod->info ? nod->info : maxim);
    else{
        int mij = (st+dr) /2;
        if(a <= mij)
            interogare(nod->st, st, mij,a, b);
        if(mij < b)
            interogare(nod->dr, mij+1, dr, a, b);
    }
}

int main(){
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    int op, a, b;

    for(int i = 1; i<=n; i++){
        scanf("%d", &a);
        actualizare(arb, 1, n, i, a);
    }
    for(int i = 1; i<=m; i++){
        scanf("%d %d %d", &op, &a, &b);
        if(op == 0){
            maxim = 0;
            interogare(arb, 1, n, a, b);
            printf("%d\n", maxim);
        }
        else
            actualizare(arb, 1, n, a, b);
    }
    return 0;
}