#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

#define NMAX 100005

int n, i, q, a[NMAX], seg[NMAX*4], c, x, y;

void build(int poz, int left, int right)
{
    if(left==right)
    {
        seg[poz]=a[left];
        return;
    }
    int mid=(left+right)/2;
    build(poz*2,left,mid);
    build(poz*2+1,mid+1,right);
    seg[poz]=max(seg[poz*2],seg[poz*2+1]);
}

int query(int poz, int left, int right, int l, int r)
{
    if(l>right || r<left)
        return 0;
    if(left>=l && right<=r)
        return seg[poz];
    int mid=(left+right)/2;
    int stanga=query(poz*2,left,mid,l,r);
    int dreapta=query(poz*2+1,mid+1,right,l,r);
    return max(stanga,dreapta);
}

void update(int poz, int left, int right, int a, int b)
{
    if(left==right)
    {
        seg[poz]=b;
        return;
    }
    int mid=(left+right)/2;
    if(a<=mid) update(poz*2,left,mid,a,b);
    else update(poz*2+1,mid+1,right,a,b);
    seg[poz]=max(seg[poz*2],seg[poz*2+1]);
}

int main()
{
    fin>>n>>q;
    for(i=1; i<=n; i++)
        fin>>a[i];
    build(1,1,n);
    for(i=1; i<=q; i++)
    {
        fin>>c>>x>>y;
        if(c==0)
        {
            fout<<query(1,1,n,x,y)<<'\n';
        }
        else
        {
            update(1,1,n,x,y);
        }
    }
    return 0;
}