#include <fstream>

using namespace std;

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

int n, m, v[100005], arb[200005];

void makeArb(int nodeIdx, int left, int right) {
    if (left == right) {
        arb[nodeIdx] = v[left];
        return;
    }
    makeArb(2 * nodeIdx, left, (left + right) / 2);
    makeArb(2 * nodeIdx + 1, (left + right) / 2 + 1, right);
    arb[nodeIdx] = max(arb[2 * nodeIdx], arb[2 * nodeIdx + 1]);
}

void updateArb(int nodeIdx, int left, int right, int poz, int val) {
    if (left == right) {
        arb[nodeIdx] = val;
        return;
    }
    if (poz <= (left + right) / 2)
        updateArb(2 * nodeIdx, left, (left + right) / 2, poz, val);
    else
        updateArb(2 * nodeIdx + 1, (left + right) / 2 + 1, right, poz, val);
    arb[nodeIdx] = max(arb[2 * nodeIdx], arb[2 * nodeIdx + 1]);
}

int interrogateArb(int nodeIdx, int left, int right, int a, int b) {
    if (a <= left && right <= b) {
        return arb[nodeIdx];
    }
    int ret = 0;
    if ((left + right) / 2 >= a) {
        ret = max(ret, interrogateArb(2 * nodeIdx, left, (left + right) / 2, a, b));
    }
    if ((left + right) / 2 + 1 <= b) {
        ret = max(ret, interrogateArb(2 * nodeIdx + 1, (left + right) / 2 + 1, right, a, b));
    }
    return ret;
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    makeArb(1, 1, n);
    for (int i = 0; i < m; i++) {
        int tip, a, b;
        cin >> tip >> a >> b;
        if (tip == 1) {
            updateArb(1, 1, n, a, b);
        } else {
            cout << interrogateArb(1, 1, n, a, b) << "\n";
        }
    }
    return 0;
}