#include <bits/stdc++.h>
using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");
#define ll long long

const int maxn = 1e5;
int aint[4 * maxn + 2];
int a[maxn+ 2];
int n, m;
void read(){
    fin >> n >> m;
    for(int i = 1; i <= n; ++i) fin >> a[i];
}
void build(int node, int st, int dr){
    if(st == dr){
        aint[node] = a[st];
        return ;
    }
    int mid = (st + dr) / 2;
    build(2 * node, st, mid);
    build(2 * node + 1, mid + 1, dr);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}
int query(int node, int st, int dr, int ql, int qr){
    if(st >= ql && dr <= qr)
        return aint[node];
    int mid = (st + dr) / 2;
    if(mid >= qr)
        return query(2 * node, st, mid, ql, qr);
    if(mid < ql)
        return query(2 * node + 1, mid + 1, dr, ql, qr);
    return max(query(2 * node, st, mid, ql,qr), query(2 * node + 1,  mid + 1, dr, ql, qr));
}
void update(int node, int st, int dr, int pos, int newval){
    if(st == dr){
        aint[node] = newval;
        return ;
    }
    int mid = (st + dr) / 2;
    if(mid >= pos)
        update(2 * node, st, mid, pos, newval);
    else update(2 * node + 1, mid + 1, dr, pos, newval);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}
int main(){
    read();
    build(1, 1, n);
    for(int i = 1; i <= m; ++i){
        int op, x, y; fin >> op >> x >> y;
        if(!op) fout << query (1, 1, n, x, y) << "\n";
        else update(1, 1, n, x, y);
    }
    return 0;
}
/*

*/