#include <fstream>
using namespace std;

int n, m;
int arr[100005];
int tree[400005];

void build(int node, int l, int r) {
    if (l == r) {
        tree[node] = arr[l];
        return;
    }
    int mid = (l + r) / 2;
    build(2 * node, l, mid);
    build(2 * node + 1, mid + 1, r);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}

void update(int node, int l, int r, int pos, int val) {
    if (l == r) {
        tree[node] = val;
        return;
    }
    int mid = (l + r) / 2;
    if (pos <= mid) {
        update(2 * node, l, mid, pos, val);
    } else {
        update(2 * node + 1, mid + 1, r, pos, val);
    }
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}

int query(int node, int l, int r, int a, int b) {
    if (a <= l && r <= b) {
        return tree[node];
    }
    int mid = (l + r) / 2;
    int res = 0;
    if (a <= mid) {
        res = max(res, query(2 * node, l, mid, a, b));
    }
    if (b > mid) {
        res = max(res, query(2 * node + 1, mid + 1, r, a, b));
    }
    return res;
}

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

    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> arr[i];
    }

    build(1, 1, n);

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

    fin.close();
    fout.close();
    return 0;
}