#include <bits/stdc++.h>

using namespace std;

const int max_size = 1e5 + 1, max_aint = 4e5 + 1;

int n, q, op, st, dr;
int a[max_size], aint[max_aint];

void init(int nod, int l, int r)
{
    if (l == r)
    {
        aint[nod] = a[l];
        return;
    }
    int m = l + r >> 1;
    init(nod * 2, l, m);
    init(nod * 2 + 1, m + 1, r);
    aint[nod] = max(aint[nod * 2], aint[nod * 2 + 1]);
}

void update(int poz, int val, int nod, int l, int r)
{
    if (l == r)
    {
        aint[nod] = val;
        return;
    }
    int m = l + r >> 1;
    if (poz <= m)
        update(poz, val, nod * 2, l, m);
    else
        update(poz, val, nod * 2 + 1, m + 1, r);
    aint[nod] = max(aint[nod * 2], aint[nod * 2 + 1]);
}

int query(int nod, int l, int r, int st, int dr)
{ // [st, dr]
    if (st <= l && r <= dr)
        return aint[nod];
    int m = l + r >> 1, p0 = 0, p1 = 0;
    if (st <= m)
        p0 = query(nod * 2, l, m, st, dr);
    if (m + 1 <= dr)
        p1 = query(nod * 2 + 1, m + 1, r, st, dr);
    return max(p0, p1);
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> q;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    init(1, 1, n);

    while (q--)
    {
        cin >> op >> st >> dr;
        if (op == 0)
        {
            cout << query(1, 1, n, st, dr) << '\n';
        }
        else
        {
            update(st, dr, 1, 1, n);
        }
    }

    return 0;
}