#include <fstream>

using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
int seg[400005];
void update (int nod, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        seg[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if (poz > mid)
        update(nod * 2 + 1, mid + 1, dr, poz, val);
    else
        update(nod * 2, st, mid, poz, val);
    seg[nod] = max(seg[nod * 2], seg[nod * 2 + 1]);
}

int query(int nod, int st, int dr, int l, int r)
{
    if (l <= st && dr <= r)
        return seg[nod];
    int mid = (st + dr) / 2, maxi = 0;
    if (mid >= l)
        maxi = max(maxi, query(2 * nod, st, mid, l, r));
    if (mid < r)
        maxi = max(maxi, query(2 * nod + 1, mid  + 1, dr, l, r));
    return maxi;
}
int main()
{
    int n, m, nr, i;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
    {
        cin >> nr;
        update(1, 1, n, i, nr);
    }
    for (i = 1; i <= m; i++)
    {
        int op, a, b;
        cin >> op >> a >> b;
        if (op == 0)
            cout << query(1, 1, n, a, b) << '\n';
        else
            update(1, 1, n, a, b);
    }
    return 0;
}