#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");


void update(int *arbInt, int nod, int st, int dr, int poz, int val){
    if(st == dr){
        arbInt[nod] = val;
        return;
    }
    int div = (st+dr)/2;
    if(poz <= div)
        update(arbInt, 2*nod, st, div, poz, val);
    else
        update(arbInt, 2*nod + 1, div + 1, dr, poz, val);
    arbInt[nod] = max(arbInt[2*nod], arbInt[2*nod+1]);
}

int query(int *arbInt, int nod, int st, int dr, int start, int finish){
    if(start <= st && dr <= finish)
        return arbInt[nod];
    int div = (st+dr)/2;
    int mx = INT_MIN;
    if ( start <= div ) mx = query(arbInt, 2*nod, st, div, start, finish);
    if ( div < finish ) mx = max(mx, query(arbInt, 2*nod+1, div+1, dr, start, finish));

    return mx;
}

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