#include <bits/stdc++.h>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
const int nMax = 100005;
int aint[4 * nMax], v[nMax];
inline void Build(int nod, int st, int dr) {
    int m = (st + dr) / 2;
    if(st == dr) {
        aint[nod] = v[st];
        return;
    }
    Build(2 * nod, st, m);
    Build(2 * nod + 1, m + 1, dr);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}
inline void Update (int nod, int st, int dr, int poz, int val) {
    int m = (st + dr) / 2;
    if(st == dr) {
        aint[nod] = val;
        return;
    }
    if(poz <= m) {
        Update(2 * nod, st, m, poz, val);
    }
    else
        Update(2 * nod + 1, m + 1, dr, poz, val);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}
inline int Query (int nod, int st, int dr, int x, int y) {
    int m = (st + dr) / 2;
    int ans = 0;
    if(x <= st && dr <= y) {
        return aint[nod];
    }
    if(x <= m) {
        ans = max(ans, Query(2 * nod, st, m, x, y));
    }
    if(y > m) {
        ans = max(ans, Query(2 * nod + 1, m + 1, dr, x, y));
    }
    return ans;
}
int main()
{
    int n, m, x, y, op;
    f>> n >> m;
    for(int i = 1; i <= n ; i++) {
        f>> v[i];
    }
    Build(1, 1, n);
    for(int i = 1 ; i <= m; i++) {
        f>> op >> x >> y;
        if(op == 1) {
            Update(1, 1, n, x, y);
        }
        else
            g<< Query(1, 1, n, x, y) << "\n" ;
    }
    return 0;
}