#include <iostream>
#include <fstream>

using namespace std;

const int MAXN = 100001;

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

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

    int mid = (left + right) / 2;
    if (pos <= mid) {
        update(2 * node, left, mid);
    } else {
        update(2 * node + 1, mid + 1, right);
    }

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

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

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

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

    cin >> n >> m;

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

        pos = i;
        val = x;
        update(1, 1, n);
    }

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

        if (op == 1) {
            pos = a;
            val = b;
            update(1, 1, n);
        } else if (op == 0) {
            start = a;
            finish = b;
            maxVal = -1;
            query(1, 1, n);
            cout << maxVal << '\n';
        }
    }

    return 0;
}