#include<fstream>
#define MAX_N 100000
#define oo 0x7fffffff
using namespace std;

int segTree[4*MAX_N+1], v[MAX_N+1], n, m, a, b;

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

void updateSegmentTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = b;
        return;
    }
    int mid = (low + high) >> 1;
    if(a <= mid) updateSegmentTree(low,mid,2*pos);
    else updateSegmentTree(mid+1,high,2*pos+1);
    segTree[pos] = max(segTree[2*pos],segTree[2*pos+1]);
}

int queryMaxSegmentTree(int low, int high, int pos) {
    if(a <= low && high <= b)
        return segTree[pos];
    if(a > high || b < low)
        return -oo;
    int mid = (low + high) >> 1;
    return max(queryMaxSegmentTree(low,mid,2*pos),queryMaxSegmentTree(mid+1,high,2*pos+1));
}

int main() {
    int i, op;
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    for(i=1; i<=n; i++)
        fin >> v[i];
    buildSegmentTree(1,n,1);
    for(i=1; i<=m; i++)
    {
        fin >> op >> a >> b;
        if(op == 0)
            fout << queryMaxSegmentTree(1,n,1) << "\n";
        else updateSegmentTree(1,n,1);
    }
    fin.close();
    fout.close();
    return 0;
}