#include <bits/stdc++.h>
using namespace std;

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

class SegmTree {
  private:
    int n;
    vector<int> tree;

    void build(int node, int left, int right, vector<int>& v) {
        if (left == right) {
            tree[node] = v[left];
            return;
        }

        int mid = (left + right) / 2;
        build(2 * node, left, mid, v);
        build(2 * node + 1, mid + 1, right, v);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }

    void update(int node, int left, int right, int pos, int val) {
        if (left == right) {
            tree[node] = val;
            return;
        }

        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 query(int node, int left, int right, int qLeft, int qRight) {
        if (left == qLeft && right == qRight)
            return tree[node];

        int mid = (left + right) / 2;
        if (qRight <= mid)
            return query(2 * node, left, mid, qLeft, qRight);
        if (qLeft > mid)
            return query(2 * node + 1, mid + 1, right, qLeft, qRight);
        return max(
            query(2 * node, left, mid, qLeft, mid),
            query(2 * node + 1, mid + 1, right, mid + 1, qRight)
        );
    }

  public:
    SegmTree(vector<int>& v) :
        n(v.size() - 1), tree(4 * n) {
            build(1, 1, n, v);
        }

    void update(int pos, int val) {
        update(1, 1, n, pos, val);
    }

    int query(int left, int right) {
        return query(1, 1, n, left, right);
    }
};

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

    SegmTree tree(v);
    for (int i = 0; i < q; i++) {
        int t, x, y; fin >> t >> x >> y;
        if (!t)
            fout << tree.query(x, y) << '\n';
        else
            tree.update(x, y);
    }

    fout.close();
    return 0;
}