#include<stdio.h>
int i,q,a,b,n,m,t,c[400001];
int Q(int p,int l,int r) {
    int d,e;
    if(l>=a&&b>=r)
        return c[p];
    if(l>b||a>r)
        return 0;
    d=Q(2*p,l,(l+r)/2);
    e=Q(2*p+1,(l+r)/2+1,r);
    return d<e?e:d;
}
int main() {
    freopen("arbint.in","r",stdin),freopen("arbint.out","w",stdout),scanf("%d%d",&n,&m);
    for(t=1;t<n;t*=2);
    for(i=t;i<n+t;i++)
        scanf("%d",c+i);
    for(i=t-1;i;i--)
        c[i]=c[2*i]<c[2*i+1]?c[2*i+1]:c[2*i];
    while(m--) {
        scanf("%d%d%d",&q,&a,&b);
        if(q)
            for(a+=t-1,c[a]=b;a/=2;c[a]=c[2*a]<c[2*a+1]?c[2*a+1]:c[2*a]);
        else
            printf("%d\n",Q(1,1,t));
    }
    return 0;
}