#include <iostream>
#include <fstream>

using namespace std;

const int MAXN = 100001;

int n, m, a[4 * MAXN + 66];

void update(int node, int left, int right, int pos, int val)
{
    if (left == right) {
        a[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);
    }

    a[node] = max(a[2 * node], a[2 * node + 1]);
}

int query(int node, int left, int right, int start, int finish)
{
    int maxVal = -1;
    if (start <= left && right <= finish) {
        maxVal = max(maxVal, a[node]);
        return a[node];
    }

    int mid = (left + right) / 2;
    if (start <= mid) {
        maxVal = max(maxVal, query(2 * node, left, mid, start, finish));
    }
    if (mid < finish) {
        maxVal = max(maxVal, query(2 * node + 1, mid + 1, right, start, finish));
    }
    return maxVal;
}

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

    cin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        int x;
        cin >> x;

        update(1, 1, n, i, x);
    }

    while (m--) {
        int op, a, b;
        cin >> op >> a >> b;

        if (op == 1) {
            update(1, 1, n, a, b);
        } else if (op == 0) {
            cout << query(1, 1, n, a, b) << '\n';
        }
    }

    return 0;
}