#include <bits/stdc++.h>
#define N_MAX 100005
#define f(x) ( x & (-x) )
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n,m,arb[2*N_MAX];
void change(int st, int dr, int val, int pos, int pos2)
{
    int m=(st+dr)/2;
    if(st==dr)
    {
        arb[pos]=val;
        return;
    }
    if(pos2<=m)
    {
        change(st,m,val,2*pos,pos2);
    }
    else if(pos2<=n)
    {
        change(m+1,dr,val,2*pos+1,pos2);
    }
    arb[pos]=max(arb[2*pos+1],arb[2*pos]);
}
int cauta(int st, int dr,int pos,int a,int b)
{
    int m=(st+dr)/2;
    int val1=0,val2=0;
    if(a<=st && dr<=b)
    {
        return arb[pos];
    }
    if(st>b || dr<a)
        return 0;
    if(a<=m)
        val1=cauta(st,m,2*pos,a,b);
    if(b>=m)
        val2=cauta(m+1,dr,2*pos+1,a,b);
    return max(val1,val2);
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=n; i++)
    {
        int x;
        in >> x;
        change(1,n,x,1,i);
    }
    for(int i=1; i<=m; i++)
    {
        int x,y,z;
        in >> x >> y >> z;
        if(x==0)
        {
            out << cauta(1,n,1,y,z) << '\n';
        }
        else
        {
            change(1,n,z,1,y);
        }
    }
    return 0;
}