#include <cstdio>

using namespace std;

const int nmax = 100007;

int aint[4*nmax];

int max(int a,int b)
{
    if(a > b)
        return a;
    return b;
}

void update(int p,int x,int node,int st,int dr)
{
    if(st == dr)
    {
        aint[node] = x;
        return;
    }
    int mid = (st+dr)/2;
    if(p <= mid)
        update(p,x,node*2,st,mid);
    else
        update(p,x,node*2+1,mid+1,dr);
    aint[node] = (aint[node*2] > aint[node*2+1] ? aint[node*2] : aint[node*2+1]);
}

int maxim(int a,int b,int node,int st,int dr)
{
    if(st >= a && b >= dr)
        return aint[node];
    int mid = (st+dr)/2;
    if(a <= mid && b <= mid)
        return maxim(a,b,node*2,st,mid);
    if(a <= mid && b > mid)
        return max(maxim(a,mid,node*2,st,mid),maxim(mid+1,b,node*2+1,mid+1,dr));
    if(a > mid && b > mid)
        return maxim(a,b,node*2+1,mid+1,dr);
}

int query(int a, int b, int node, int st, int dr)
{
    if(a <= st && dr <= b)//complet inclus
        return aint[node];
    if(a > dr || b < st) //complet disjunct
        return 0;
    int mid = (st+dr)/2;
    return max(maxim(a,b,node*2,st,mid),maxim(a,b,node*2+1,mid+1,dr));
}

int main()
{

    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i = 1;i <= n;i ++)
    {
        int x;
        scanf("%d",&x);
        update(i,x,1,1,1 << 17);
    }
    for(int i = 1;i <= m;i ++)
    {
        int t,a,b;
        scanf("%d %d %d",&t,&a,&b);
        if(t == 0)
            printf("%d\n",maxim(a,b,1,1,1 << 17));
        else
            update(a,b,1,1,1 << 17);
    }
    return 0;
}