#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
int n,m,poz,val,a,b;
//struct nod{int s; int d; int m=-1;};
//struct nod v[4000010];
int v[4000010];
void actualizeaza(int nod, int stg,int drp)
{
    if(drp==stg)
    {
        if(stg==poz ) v[nod]=val;

    }
    else
    {
 int m=(stg+drp)/2;
 if(poz<=m)actualizeaza(2*nod,stg,m);
 if(poz>=m)actualizeaza(2*nod+1,m+1,drp);
 if(v[2*nod]>v[2*nod+1])v[nod]=v[2*nod];
 else v[nod]=v[2*nod+1];
    }
}

int interog(int nod,int stg, int drp)
{

    if(stg>b || drp <a)return -1;
    if(stg==drp){ if(a<=stg && drp<=b) return v[nod]; return -1; }
    else{
if(a<=stg && drp<=b)return v[nod];
else{

    int m1=-1; int m2=-1;
    int mj=(stg+drp)/2;
    if(a<=mj)m1=interog(2*nod,stg,mj);
    if(b>mj)m2=interog(2*nod+1,mj+1,drp);
    if(m1>m2)return m1;
    return m2;
}
    }
}

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

for(int i=1; i<=n; i++)
{
    scanf("%d",&val);
    poz=i;
    actualizeaza(1,1,n);
}

int c1,c2,c3;

for(int i=1; i<=m; i++)
{
    scanf("%d %d %d",&c1,&c2,&c3);
    if(!c1){a=c2; b=c3;
            printf("%d\n",interog(1,1,n)); }
else {
poz=c2; val=c3;
    actualizeaza(1,1,n);
}
}


    return 0;
}