#include <fstream>

using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
int seg[400005];
void update(int nod, int l, int r, int poz, int val)
{
    int mid;
    if (r == l)
    {
        seg[nod] = val;
        return;
    }
    mid = (l + r) / 2;
    if (poz <= mid)
        update (2 * nod, l, mid, poz, val);
    else
        update (2 * nod + 1, mid + 1, r, poz, val);
    seg[nod] = max(seg[2 * nod],seg[2 * nod + 1]);
}
int query (int nod, int l, int r, int ql, int qr)
{
    int mid, maxi = 0;
    if (ql <= l&& r <= qr)
        return seg[nod];
    mid = (l + r) / 2;
    if (mid >= ql)
        maxi = max(maxi, query(2 * nod, l, mid, ql, qr));
    if (mid < qr)
        maxi = max(maxi, query(2 * nod + 1, mid + 1, r, ql, qr));
    return maxi;

}
int main()
{
    int n, m, i, nr, a, b, val, op;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
    {
        cin >> nr;
        update(1, 1, n, i, nr);
    }
    for (i = 1; i <= m; i++)
    {
        cin >> op >> a >> b;
        if (op == 0)
            cout << query(1, 1, n, a, b) << '\n';
        else
            update (1, 1, n, a, b);
    }
    return 0;
}