#include <fstream>
#include <vector>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
const int NMAX = 100005;
vector<int> aint(4 * NMAX);
void build(int nod, int l, int r, vector<int>& v){
    if(l == r){
        aint[nod] = v[l];
        return;
    }
    const int mid = (l + r) / 2;

    build(2 * nod, l, mid, v);
    build(2 * nod + 1, mid + 1, r, v);

    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}
int query(int nod, int l, int r, const int a, const int b){
    if(l == a and r == b)
        return aint[nod];
    
    const int mid = (l + r) / 2;
    if(b <= mid)
        return query(2 * nod, l, mid, a, b);
    
    else if(a > mid)
        return query(2 * nod + 1, mid+1, r, a, b);
        
    return max(query(2 * nod, l, mid, a, mid), query(2 * nod + 1, mid+1, r, mid+1, b));
}

void update(int nod, int l, int r, const int poz, const int val){
    if(l == r){
        aint[nod] = val;
        return;
    }

    const int mid = (l + r) / 2;
    if(poz <= mid)
        update(2 * nod, l, mid, poz, val);
    
    else update(2 * nod + 1, mid + 1, r, poz, val);

    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

int main(){
    int n, m;
    cin>>n>>m;
    vector<int> v(n + 1);

    for(int i=1; i<=n; i++)
        cin>>v[i];
    
    build(1, 1, n, v);

    while(m--){
        int tip, x, y;
        cin>>tip>>x>>y;

        if(!tip)
            cout<<query(1, 1, n, x, y)<<'\n';
        
        else update(1, 1, n, x, y);
    }
    return 0;
}