#include<cstdio>
#define MAX_N 100000
#define oo 0x3f3f3f3f
using namespace std;

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

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

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

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

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

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 = 0; i < n; i++)
        fscanf(fin,"%d",&v[i]);
    buildSegTree(0,n-1,0);
    for(i = 0; i < m; i++) {
        fscanf(fin,"%d%d%d",&op,&qlow,&qhigh);
        if(op == 0) {
            qlow--;
            qhigh--;
            fprintf(fout,"%d\n",queryMax(0,n-1,0));
        } else {
            qlow--;
            updateSegTree(0,n-1,0);
        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}