#include <bits/stdc++.h>
#define NMAX 100001

using namespace std;

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

int n, m, q, a, b;
int A[4 * NMAX];

void update(int nod, int st, int dr, int pos, int val) {
    if(st == dr) A[nod] = val;
    else {
        int mj = (st + dr) / 2;
        if(pos <= mj)
            update(2 * nod, st, mj, pos, val);
        else if(pos > mj)
            update(2 * nod + 1, mj + 1, dr, pos, val);
        A[nod] = max(A[2 * nod], A[2 * nod + 1]);
    }
}

int query(int nod, int st, int dr, int x, int y) {
    if(st >= x && dr <= y) return A[nod];
    else {
        int maxDr = 0, maxSt = 0;
        int mj = (st + dr) / 2;
        if(mj >= x)
            maxSt = query(2 * nod, st, mj, x, y);
        if(mj < y)
            maxDr = query(2 * nod + 1, mj + 1, dr, x, y);
        return max(maxSt, maxDr);
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++) {
        fin >> a;
        update(1, 1, n, i, a);
    }
    while(m--) {
        fin >> q >> a >> b;
        if(q == 1) update(1, 1, n, a, b);
        else fout << query(1, 1, n, a, b) << '\n';
    }

    return 0;
}