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

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

int n, m, act, x, y, mx;
int T[4*nmax], V[nmax];

void build(int i, int st, int dr)
{
    if (st == dr) T[i] = V[st];
    else
    {
        int mid = (st+dr)/2;
        build(2*i, st, mid);    //stanga
        build(2*i+1, mid+1, dr);//dreapta
        T[i] = max(T[2*i], T[2*i+1]);
    }
    return;
}
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(2*i, st, mid, poz, val);    //stanga
                 else update(2*i+1, mid+1, dr, poz, val);//dreapta
        T[i] = max(T[2*i], T[2*i+1]);
    }
    return;
}

void search(int i, int st, int dr, int a, int b)
{
    if (a<=st && dr<=b) mx = max(mx, T[i]);
    else
    {
        int mid = (st+dr)/2;
        if (a<=mid) search(2*i, st , mid, a, b);
        if (mid <b) search(2*i+1, mid+1, dr, a, b);
    }
    return;
}
int main()
{
    f >> n >> m;
    for(int i=1; i<=4*nmax; i++)
        T[i] = -inf;

    for(int i=1; i<=n; i++)
    {
        f >> V[i];
    }

    build(1, 1, n);

    for(int i=1; i<=m; i++)
    {
        f >> act >> x >> y;
        if(act == 1) update(1, 1, n, x, y);
        else
        {
            mx = -inf;
            search(1, 1, n, x, y);
            g << mx << "\n";
        }
    }
    f.close();
    g.close();
    return 0;
}