#include <fstream>
#define dim 100001
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");

int tree[4*dim], v[dim];

void build_tree(int nod, int st, int dr)
{
    if(st==dr)
    {
        tree[nod]=v[st];
    }
    else
    {
        int mid=(st+dr)/2;
        build_tree(2*nod, st, mid);
        build_tree(2*nod+1, mid+1, dr);
        tree[nod]=max(tree[2*nod], tree[2*nod+1]);
    }
}

void update(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        tree[nod]=val;
    }
    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 a, int b)
{
    if(a<=st&&dr<=b)
    {
        return tree[nod];
    }
    else
    {
        int mid=(st+dr)/2;
        if(b<=mid)
        {
            return query(2*nod, st, mid, a, b);
        }
        if(mid<a)
        {
            return query(2*nod+1, mid+1, dr, a, b);
        }
        return max(query(2*nod, st, mid, a, b), query(2*nod+1, mid+1, dr, a, b));
    }
}

int main()

{
    int n, m, i, c, x, y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    build_tree(1, 1, n);
    for(i=1;i<=m;i++)
    {
        fin>>c;
        if(c==0)
        {
            fin>>x>>y;
            fout<<query(1, 1, n, x, y)<<"\n";
        }
        else
        {
            fin>>x>>y;
            update(1, 1, n, x, y);
        }
    }
}