#include <fstream>
#include <vector>
#include <climits>

using namespace std;

ifstream cin("arbint.in");
ofstream cout("arbint.out");

int n, m;
vector<int> v;

class Segment_Tree {
    vector<int> tree;
    int size;
    void _build(int node, int left, int right) {
        if (left == right) {
            tree[node] = v[left];
            return;
        }
        int middle = (left + right) / 2;
        _build(2 * node, left, middle);
        _build(2 * node + 1, middle + 1, right);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
    void _update(int node, int left, int right, int position, int value) {
        if (left == right) {
            tree[node] = value;
            return;
        }
        int middle = (left + right) / 2;
        if (position <= middle) _update(2 * node, left, middle, position, value);
        else _update(2 * node + 1, middle + 1, right, position, value);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
    void _query(int node, int left, int right, int start_position, int end_position, int &ans) {
        if (start_position <= left && end_position >= right) {
            ans = max(ans, tree[node]);
            return;
        }
        int middle = (left + right) / 2;
        if (start_position <= middle) _query(2 * node, left, middle, start_position, end_position, ans);
        if (end_position > middle) _query(2 * node + 1, middle + 1, right, start_position, end_position, ans);
    }
public:
    Segment_Tree(int size) {
        this->size = size;
        tree.assign(4 * size + 2, 0);
        _build(1, 1, size);
    }
    void update(int position, int value) {
        _update(1, 1, size, position, value);
    }
    void query(int start_position, int end_position, int &ans) {
        _query(1, 1, size, start_position, end_position, ans);
    }
};

int main() {
    cin >> n >> m;
    v.assign(n + 2, -1);
    for (int i = 1 ; i <= n ; ++i) {
        cin >> v[i];
    }
    Segment_Tree t(n);
    for (int i = 1 ; i <= m ; ++i) {
        int op, a, b;
        cin >> op >> a >> b;
        if (op == 0) {
            int ans = INT_MIN;
            t.query(a, b, ans);
            cout << ans << "\n";
        }
        if (op == 1) {
            t.update(a, b);
        }
    }
    return 0;
}