#include <iostream>
#include <fstream>
using namespace std;
#define INF 999999999;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, a[200005];
void update(int node, int l, int r, int p, int v) {
    if (l == r)
    {
        a[node] = v;
        return;
    }
    int m = (l + r) / 2;
    int ls = node * 2, rs = ls + 1;
    if (p <= m)
         update(ls, l, m, p, v);
    else
         update(rs, m + 1, r, p, v);
    a[node] = max(a[ls], a[rs]);
}
int query(int node, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) {
        return a[node];
    }
    int m = (l + r) / 2;
    int ls = node * 2, rs = ls + 1;
    int ans = -INF;
    if (ql <= m)
        ans = max(ans, query(ls, l, m, ql, qr));
    if (qr > m)
        ans = max(ans, query(rs, m+1, r, ql, qr));
    return ans;
}
void readAndInit() {
    fin >> n >> m;
    int v;
    for (int i = 1; i <= n; ++i) {
        fin >> v;
        update(1, 1, n, i, v);
    }
}
int main() {
    readAndInit();
    bool tip;
    int a, b;
    for (int i = 0; i < m; ++i) {
        fin >> tip >> a >> b;
        if (tip) {
            update(1, 1, n, a, b);
        }
        else
            fout << query(1, 1, n, a, b) << "\n";
    }
    return 0;
}