#include <iostream>
#include <fstream>
#define MAX 100002
using namespace std;
int aint[4*MAX],v[MAX],n,m,t,a,b,ans;

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

void build(int nod, int st, int dr){
    if(st == dr){
        aint[nod] = v[st];
    }else{
        int mid = (st+dr)/2;
        build(2*nod, st, mid);
        build(2*nod+1, mid+1, dr);
        aint[nod] = max(aint[2*nod],aint[2*nod+1]);
    }
}

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

void query(int nod, int st, int dr, int a, int b){
    if(a <= st && dr <= b){
        ans = max(ans, aint[nod]);
    }else{
        int mid = (st+dr)/2;
        if(a <= mid){
            query(2*nod, st, mid, a, b);
        }
        if(b >= mid+1){
            query(2*nod+1, mid+1, st, a, b);
        }
    }
}

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