#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m;
int v[int(1e5) + 5];
int aint[int(4e5) + 5];
int ans = 0;
void update(int curr_pos, int left, int right, int pos, int val){
    if (left == right){
        aint[curr_pos] = val;
        return;
    }
    int mid = (left + right) / 2;
    if (pos <= mid)
        update(2 * curr_pos, left, mid, pos, val);
    else
        update(2 * curr_pos + 1, mid + 1, right, pos, val);
    aint[curr_pos] = max(aint[2 * curr_pos], aint[2 * curr_pos + 1]);
}
void query(int curr_pos, int left, int right, int query_left, int query_right){
    if (left == right || (query_left <= left && right <= query_right)){
        ans = max(ans, aint[curr_pos]);
        return;
    }
    int mid = (left + right) / 2;
    if (query_left <= mid)
        query(2 * curr_pos, left, mid, query_left, query_right);
    if (query_right > mid)
        query(2 * curr_pos + 1, mid + 1, right, query_left, query_right);
}
int main(){
    fin >> n >> m;
    for (int i = 1; i <= n; i++){
        fin >> v[i];
        update(1, 1, n, i, v[i]);
    }
    for (int i = 1; i <= m; i++){
        int op, a, b;
        fin >> op >> a >> b;
        if (op == 0){
            ans = 0;
            query(1, 1, n, a, b);
            fout << ans << '\n';
        } else if (op == 1){
            update(1, 1, n, a, b);
        }
    }
    return 0;
}