#include<cstdio>
#define MAX_N 100000
#define MAX_VALUE 0x7fffffff
using namespace std;

int segTree[4*MAX_N+1], v[MAX_N+1], n, m, qlow, qhigh;

inline int maxim(int x, int y) {
    if(x >= y)
        return x;
    return y;
}

void buildSegmentTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = v[low];
    } else {
        int mid = (low + high) >> 1;
        buildSegmentTree(low,mid,2*pos);
        buildSegmentTree(mid+1,high,2*pos+1);
        segTree[pos] = maxim(segTree[2*pos],segTree[2*pos+1]);
    }
}

void updateSegTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = qhigh;
    } else {
        int mid = (low + high) >> 1;
        if(qlow <= mid)
            updateSegTree(low,mid,2*pos);
        else updateSegTree(mid+1,high,2*pos+1);
        segTree[pos] = maxim(segTree[2*pos],segTree[2*pos+1]);
    }
}

int rangeMinQuery(int low, int high, int pos) {
    if(qlow <= low && high <= qhigh)
        return segTree[pos];
    if(qlow > high || qhigh < low)
        return -MAX_VALUE;
    int mid = (low + high) >> 1;
    return maxim(rangeMinQuery(low,mid,2*pos),rangeMinQuery(mid+1,high,2*pos+1));
}

int main() {
    int i, op;
    FILE* fin, *fout;
    fin = fopen("arbint.in","r");
    fout = fopen("arbint.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i = 1; i <= n; i++)
        fscanf(fin,"%d",&v[i]);
    buildSegmentTree(1,n,1);
    for(i = 0; i < m; i++) {
        fscanf(fin,"%d%d%d",&op,&qlow,&qhigh);
        if(op == 0)
            fprintf(fout,"%d\n",rangeMinQuery(1,n,1));
        else
            updateSegTree(1,n,1);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}