#include <iostream>
#include <fstream>
#define MAX 100000
using namespace std;
int seg[MAX*4+2],v[MAX],n,m,x,y,t;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

void build(int nod, int l, int r){
    /// nod - pozitia in vectorul seg
    /// [l, r] - intervalul pe care il construim
    if(l == r){
        seg[nod] = v[l];
    }else{
        int mid = (l+r)/2;
        build(2*nod, l, mid);
        build(2*nod+1, mid+1, r);
        seg[nod] = max(seg[2*nod], seg[2*nod+1]);
    }
}

void update(int nod, int l, int r, int pos, int val){
    /// nod - pozitia in seg
    /// [l, r] - interval
    /// pos - pozitia in a
    /// val - noua valoare
    if(l == r){
        seg[nod] = val;
    }else{
        /// incepem de sus, schimbam jos apoi sus
        int mid = (l+r)/2;
        if(pos <= mid){
            update(nod*2, l, mid, pos, val);
        }else{
            update(nod*2+1, mid+1, r, pos, val);
        }
        seg[nod] = max(seg[nod*2], seg[nod*2+1]);
    }
}

int query(int nod, int l, int r, int ql, int qr){
    /// nod - pozitia in seg
    /// [l, r]   - intervalul cu care lucram
    /// [ql, qr] - intervalul de care ne pasa
    if(ql <= l && r <= qr){
        return seg[nod];
    }else{
        int mid = (l+r)/2;
        if(qr <= mid){
            return query(2*nod, l, mid, ql, qr);
        }else if(mid+1 <= ql){
            return query(2*nod+1, mid+1, r, ql, qr);
        }
        return max(query(2*nod, l, mid, ql, qr),
                   query(2*nod+1, mid+1, r, ql, qr));
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
    }
    build(1, 1, n);
    for(int i = 1; i <= 4*n; i++){
        fout << seg[i] << " ";
    }
    fout << "\n";
    while(m--){
        fin >> t >> x >> y;
        if(t == 0){
            fout << query(1, 1, n, x, y) << "\n";
        }else{
            update(1, 1, n, x, y);
        }
    }
    return 0;
}