#include <fstream>
#define MX 100001
using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m;
int a[2*MX];

int maxim(int i, int j)
{
    if(i > j) return i;
    return j;
}

void update(int nod, int left, int right, int poz, int x)
{
    if(left == right)
    {
        a[nod] = x;
        return;
    }

    int mid = (left+right)/2;
    if(poz <= mid) update(2*nod, left, mid, poz, x);
    else update(2*nod+1, mid+1, right, poz, x);

    //a[nod] = maxim(a[2*nod], a[2*nod+1]);
}

int query(int nod, int left, int right, int i, int j)
{
    if(left == right)
    {
        if(left<i || right>j) return 0;
        return a[nod];
    }

    int mid = (left+right)/2;
    int s,d;
    s=d=0;
    if(i <= mid)
    {
        s = query(2*nod, left, mid, i, j);
    }

    if(mid < j)
    {
        d = query(2*nod+1, mid+1, right, i, j);
    }

    //fout<<nod<<left<<right<<'\n';
    a[nod] = maxim(s, d);
    return a[nod];
}

void citire()
{
    int i,x;
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>x;
        update(1, 1, n, i, x);
    }
}

int main()
{
    int i,j,t,x,y;
    citire();
    /*for(i=1; i<=2*n; i++) fout<<a[i]<<' ';
    fout<<'\n';*/
    for(i=1; i<=m; i++)
    {
        fin>>t>>x>>y;
        if(t == 0)
        {
            query(1, 1, n, x, y);
            fout<<a[1]<<'\n';
        }
        else
        {
            update(1, 1, n, x, y);
        }
        /*for(j=1; j<=2*n; j++) fout<<a[j]<<' ';
        fout<<'\n';*/
    }

    fin.close(); fout.close();
    return 0;
}