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

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

inline int maxim(int a, int b) {
    if(a >= b) return a;
    return b;
}

void buildSegmentTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = arr[low];
        return;
    }
    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 updateSegmentTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = qhigh;
        return;
    }
    int mid = (low + high) >> 1;
    if(qlow <= mid) updateSegmentTree(low,mid,2*pos);
    else updateSegmentTree(mid+1,high,2*pos+1);
    segTree[pos] = maxim(segTree[2*pos],segTree[2*pos+1]);
}

int maxQuery(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(maxQuery(low,mid,2*pos),maxQuery(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",&arr[i]);
    buildSegmentTree(1,n,1);
    for(i = 1; i <= m; i++) {
        fscanf(fin,"%d%d%d",&op,&qlow,&qhigh);
        if(op == 0)
            fprintf(fout,"%d\n",maxQuery(1,n,1));
        else updateSegmentTree(1,n,1);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}