#include <stdio.h>

using namespace std;
int nod,arb[(1<<19)+1],i,n,m,x,poz,pc,a,b,op;
void actualizare(int nod, int st, int dr)
{
    if (st>=poz && dr<=poz)
    {
        arb[nod]=x;
        return;
    }
    int m=(st+dr)/2;
    if (poz<=m) actualizare(2*nod,st,m);
          else actualizare (2*nod+1,m+1,dr);
    if (arb[2*nod]>arb[2*nod+1]) arb[nod]=arb[2*nod];
          else arb[nod]=arb[2*nod+1];
}


int interogare(int nod, int st, int dr)
{
    if (a<=st && dr<=b)
        return arb[nod];
    int m=(st+dr)/2;
    int x1;
    int x2;
    x1=x2=0;
    if (a<=m) x1=interogare(nod*2,st,m);
    if (b>m) x2=interogare (nod*2+1,m+1,dr);
    if (x1>x2) return x1;
    else return x2;
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1; i<=n; i++)
    {
        scanf("%d ",&x);poz=i;
        actualizare(1,1,n);
    }
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d\n",&op,&a,&b);
        if (op==1)
        {
            poz=a;
            x=b;
            actualizare(1,1,n);
        }
        else
        {
            printf("%d\n",interogare(1,1,n));
        }
    }
    return 0;
}