#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int MAXN = 100005;
int N, M;
vector<int> A(MAXN), tree(4 * MAXN);
void build(int node, int left, int right) {
    if (left == right) {
        tree[node] = A[left];
    } else {
        int mid = (left + right) / 2;
        build(2 * node, left, mid);//subarbore stang
        build(2 * node + 1, mid + 1, right);//subarbore drept
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);//iau tatal max dintre fii
    }
}
int query(int node, int left, int right, int l, int r) {
    // l,r val intervalului de cautare dorit
    // left, right in ce interval caut eu acm
    if (r < left || right < l) return 0;
    if (l <= left && right <= r) return tree[node];
    int mid = (left + right) / 2;
    return max(query(2 * node, left, mid, l, r),
               query(2 * node + 1, mid + 1, right, l, r));
}
void update(int node, int left, int right, int pos, int val) {
    if (left == right) {
        tree[node] = val;
    } else {
        int mid = (left + right) / 2;
        if (pos <= mid) update(2 * node, left, mid, pos, val);
        else update(2 * node + 1, mid + 1, right, pos, val);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
}
int main() {
    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
        fin >> A[i];
    build(1, 1, N);
    for (int i = 0; i < M; ++i) {
        int type, a, b;
        fin >> type >> a >> b;
        if (type == 0) {
            fout << query(1, 1, N, a, b) << '\n';
        } else {
            update(1, 1, N, a, b);
        }
    }
    return 0;
}