#include <cstdio>
#include <cmath>
using namespace std;
const char iname[] = "arbint.in";
const char oname[] = "arbint.out";
const int MAXN = 100005;
const int MAXN2 = 131080;
int A[MAXN], arbint[2*MAXN - 1];
int n, m, pwr = 1;

void actualizare(int nod, int st, int dr, int poz, int val){
    if(poz <= st && dr <= poz) arbint[nod] = val;
    else{
        int mij = (st + dr) / 2;
        if(poz <= mij) actualizare(2*nod,st, mij, poz, val);
        else actualizare(2*nod + 1, mij+1, dr, poz, val);
        if(arbint[2*nod] > arbint[2*nod +1]) arbint[nod] = arbint[2*nod];
        else arbint[nod] = arbint[2*nod + 1];
    }
}
int interogare(int nod, int st, int dr, int a, int b){
    if(a <= st && dr <= b) return arbint[nod];
    else{
        int mij = (st + dr) / 2;
        int left = 0, right = 0;
        if(a <= mij) left = interogare(2*nod, st, mij, a, b);
        if(mij < b) right = interogare(2*nod+1, mij+1, dr, a,b);
        if(left < right) return right;
        return left;
    }
}
void print(int n, int *v){
    for(int i = 1; i <= n; ++i)
        printf("%d ", v[i]);
    printf("\n");
}
void read(){
    scanf("%d %d\n", &n, &m);
    for(int i = 1; i <= n; ++i){
        int aux;
        scanf("%d", &aux);
        actualizare(1, 1, n, i,aux);
    }
}
void solve(){
    for(int i = 0; i < m; ++i){
        int c,a,b;
        scanf("%d %d %d", &c, &a, &b);
        if(c == 0) printf("%d\n", interogare(1, 1,n,a,b));
        else{
            actualizare(1,1,n,a,b);
        }
    }
}
int main()
{
    freopen(iname, "r", stdin);
    freopen(oname, "w",stdout);
    read();
    solve();
    return 0;
}