#include<cstdio>
#define M 5000000
int i,q,a,b,n,m,t,c[270000],j,o,h;
char p[M];
inline int A()
{
  	int s=0;
  	for(;p[o]<'0'||p[o]>'9';o++);
  	for(;p[o]>='0'&&p[o]<='9';o++)
  		s=s*10+p[o]-'0';
  	return s;
}
inline void S(int x)
{
    int i,d=x>999999999?10:x>99999999?9:x>9999999?8:x>999999?7:x>99999?6:x>9999?5:x>999?4:x>99?3:x>9?2:1;
    for(i=d-1;i>=0;x/=10,i--)
        p[h+i]=x%10+48;
    p[h+d]=10,h+=d+1;
}
inline int Q(int p,int l,int r)
{
    if(l>=a&&b>=r)
        return c[p];
    if(l>b||a>r)
        return 0;
    int d,e,f=p<<1,g=(l+r)>>1;
    d=Q(f,l,g),e=Q(f+1,g+1,r);
    return d<e?e:d;
}
int main()
{
    freopen("arbint.in","r",stdin),freopen("arbint.out","w",stdout),fread(p,1,M,stdin),n=A(),m=A();
    for(t=1;t<n;t<<=1);
    for(i=t;i<n+t;i++)
        c[i]=A();
    for(i=t-1;i;i--)
        j=i<<1,c[i]=c[j]<c[j+1]?c[j+1]:c[j];
    while(m--)
	{
        q=A(),a=A(),b=A();
        if(q)
            for(a+=t-1,c[a]=b;a>>=1;j=a<<1,c[a]=c[j]<c[j+1]?c[j+1]:c[j]);
        else
            S(Q(1,1,t));
    }
    fwrite(p,1,h,stdout);
}