#include <stdio.h>
#define MAX 100005
int maxim = -1;

int max(int a,int b){

    if(a > b)
        return a;
    return b;
}

void apdeit(int nod,int st,int dr,int val,int poz,int arb[MAX * 4]){

    if(st == dr){
        arb[nod] = val;
        return;
    }

    int mid;
    mid = (st + dr) / 2;
    if(poz <= mid)
        apdeit(nod * 2,st,mid,val,poz,arb);
    else
        apdeit(nod * 2 + 1,mid + 1,dr,val,poz,arb);

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

void cueri(int nod,int st,int dr,int c1,int c2,int arb[MAX * 4]){

    if(c2 < st || dr < c1)
        return;

    if(c1 <= st && dr <= c2){
        if(maxim < arb[nod])
            maxim = arb[nod];
        return;
    }

    int mid = (st + dr) / 2;
    if(c1 <= mid)
        cueri(nod * 2,st,mid,c1,c2,arb);
    else
    if(mid < c2)
        cueri(nod * 2 + 1,mid + 1,dr,c1,c2,arb);
}

int main(){

    int v[MAX], arb[4 * MAX], i, j, x, n, m, mod, y;
    FILE *f, *g;
    f = fopen("arbint.in","r");
    g = fopen("arbint.out","w");

    fscanf(f,"%d %d",&n,&m);
    for(i = 1;i <= n; ++i){
        fscanf(f,"%d",&v[i]);
        apdeit(1,1,n,v[i],i,arb);
    }

    for(i = 1;i <= m; ++i){

        fscanf(f,"%d %d %d",&mod,&x,&y);

        if(mod == 1)
            apdeit(1,1,n,y,x,arb);
        else{
            maxim = -1;
            cueri(1,1,n,x,y,arb);
            fprintf(g,"%d\n",maxim);
        }
    }
    return 0;
    fclose(f);
    fclose(g);
}