#include <iostream>
#include <fstream>
using namespace std;

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

const int NMAX = 100005;

int n, m, v[NMAX], i, x , y, sol;
int MaxArb[2 * NMAX];

void query(int nod, int start, int end, int l, int r) {
    if (l <= start && r >= end)
    {
        sol = max(sol, MaxArb[nod]);
        return;
    }

    int mij = (start + end) / 2;
    int m1 = 0, m2 = 0;
    if(l <= mij)
        query(2 * nod, start, mij, l, r);
    if(mij < r)
        query(2 * nod + 1, mij + 1, end, l, r);
}

void update(int nod, int start, int end, int position, int value) {
    if (start == end) {
        v[position] = value;
        MaxArb[nod] = value;
        return;
    }

    int mid = (start + end) / 2;
    if ( position <= mid) {
        update(2 * nod, start, mid,  position, value);
    } else {
        update(2 * nod + 1, mid + 1, end,  position, value);
    }

    MaxArb[nod] = max(MaxArb[2 * nod], MaxArb[2 * nod + 1]);
}

void build(int nod, int start, int end) {
    if (start == end) {
        MaxArb[nod] = v[end];
        return;
    }

    int mid = (start + end) / 2;
    build(2 * nod, start, mid);
    build(2 * nod + 1, mid + 1, end);
    MaxArb[nod] = max(MaxArb[2 * nod], MaxArb[2 * nod + 1]);
}




int main() {

    fin >> n >> m;
    for (i = 1; i <= n; ++i)
    {
        fin >> v[i];
    }
    build(1, 1, n);

    // Perform operations
    for ( i = 1; i <= m; ++i) {
        int o, a, b;
        fin >> o >> x >> y;
        if (o == 0) {
            sol = -1000000000;
            query(1, 1, n, x, y);
            fout << sol << "\n";
        } else {
            update(1, 1, n, x, y);
        }
    }

    return 0;
}