#include <iostream>
#include <fstream>
#define inf (1<<30)
#define nmax 100005
using namespace std;

int T[4*nmax];

void update(int i, int st, int dr, int poz, int val)
{
    if (st == dr) T[i] = val;
    else
    {
        int mid = (st + dr)/2;
        if(poz <= mid) update(i*2, st, mid, poz, val);
                  else update(i*2+1, mid+1, dr, poz, val);
        T[i] = max(T[2*i], T[2*i+1]);
    }
}

int maxim;

void search(int i, int st, int dr, int a, int b)
{
    if (a<=st && dr <=b) maxim = max(maxim, T[i]);
    else
    {
        int mid = (st+dr)/2;
        if (a <= mid) search(i*2, st, mid, a, b);
        if (b > mid ) search(i*2+1, mid+1, dr, a, b);
    }
}

int main()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");

    int n , m, x, y, act;
    f >> n >> m;
    for(int i=1; i<=4*nmax; i++)
        T[i] = -inf;
    for(int i=1; i<=n; i++)
    {
        f >> x;
        update(1, 1, n, i, x);
    }
    for(int i=1; i<=m; i++)
    {
        f >> act >> x >> y;
        if (act == 1) update(1, 1, n, x, y);
        else
        {
            maxim = -inf;
            search(1, 1, n, x, y);
            g << maxim << "\n";
        }
    }

    f.close();
    g.close();

    return 0;
}