#include <iostream>
#include <fstream>
using namespace std;

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

int tree[400005];
int v[100005];

void build (int node, int st, int dr) {
    if(st == dr)
        tree[node] = v[st];
    else {
        int mij = (st + dr) / 2;
        build(node*2, st, mij);
        build(node*2+1, mij+1, dr);
        tree[node] = max(tree[node*2], tree[node*2+1]);
    }
}

void update (int node, int st, int dr, int ind, int new_val) {
    if(st == dr) {
        tree[node] = new_val;
    } else {
        int mij = (st + dr) / 2;
        if(ind <= mij)
            update(node*2, st, mij, ind, new_val);
        if(ind > mij)
            update(node*2+1, mij+1, dr, ind, new_val);
        tree[node] = max(tree[node*2], tree[node*2+1]);
    }
}

int maxim (int node, int st, int dr, int le, int ri) {
    if(st > dr) return 0;
    if(st == le && dr == ri)
        return tree[node];
    else {
        int mij = (st + dr) / 2;
        int max1 = 0, max2 = 0;
        if(le <= mij)
            max1 = maxim(node*2, st, mij, le, min(mij, ri));
        if(ri > mij)
            max2 = maxim(node*2+1, mij+1, dr, max(le, mij+1), ri);

        return max(max1, max2);
    }
}

int main()
{
    int n, m; fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        fin >> v[i];

    build(1, 1, n);

    for(int i = 1; i <= m; ++i){
        int op, x, y;
        fin >> op >> x >> y;
        if(op == 0) {
            fout << maxim(1, 1, n, x, y) << "\n";
        } else {
            update(1, 1, n, x, y);
        }
    }

    return 0;
}