#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int n, m;
int tree[400001];
int a[100001];
void update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        tree[nod] = val;
        return;
    }
    else
    {
        int mid = (st + dr) / 2;
        if (poz <= mid)
            update(2 * nod, st, mid, poz, val);
        else
            update(2 * nod + 1, mid + 1, dr, poz, val);
        tree[nod] = max(tree[2 * nod], tree[2 * nod + 1]);
    }
}
int query(int nod, int st, int dr, int star, int drar)
{
    if(star<=st && dr<=drar)
        return tree[nod];
    else
    {
        int mid = (st + dr) / 2;
        int r1, r2;
        r1 = r2 = 0;
        if (star <= mid)
            r1 = query(2 * nod, st, mid, star, drar);
        if (drar > mid)
            r2 = query(2 * nod + 1, mid+1, dr, star, drar);
        return max(r1, r2);
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        update(1,1,n,i,a[i]);
    }
    for (int i = 0; i < m; i++)
    {
        int cerinta, st, dr;
        cin >> cerinta >> st >> dr;
        if (cerinta)
            update(1, 1, n, st, dr);
        else
            cout << query(1, 1, n, st, dr) << '\n';
    }
    return 0;
}