#include <cstdio>
#define MX 100001
#define maxim(a,b) ((a>b) ? a : b)
using namespace std;

FILE *fin, *fout;

int n,m;
int a[3*MX], nr[MX];
int p1,p2;

/*inline int maxim(int i, int j)
{
    /*if(i > j) return i;
    return j;
    (i > j) ? i : j;
}*/

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

    int mid = (left+right)>>1;
    if(p1 <= mid) update(nod<<1, left, mid);
    else update((nod<<1)+1, mid+1, right);

    a[nod] = maxim(a[nod<<1], a[(nod<<1)+1]);
}

inline int query(int nod, int left, int right)
{
    if(p1<=left && right<=p2) return a[nod];

    int mid = (left+right)>>1;
    int s,d;
    s=d=0;
    if(p1 <= mid)
    {
        s = query(nod<<1, left, mid);
    }

    if(mid < p2)
    {
        d = query((nod<<1)+1, mid+1, right);
    }

    return maxim(s, d);
}

void citire()
{
    int i;

    //
    fscanf(fin, "%d%d", &n, &m);
    for(i=1; i<=n; i++) fscanf(fin, "%d", &nr[i]);
    for(i=1; i<=n; i++)
    {
        //fscanf(fin, "%d", &p2);
        p1 = i;
        p2 = nr[i];
        update(1, 1, n);
    }
}

int main()
{
    int i,t,r;

    fin = fopen("arbint.in", "r");
    fout = fopen("arbint.out", "w");
    //setbuf(fin, NULL);

    citire();
    for(i=1; i<=m; i++)
    {
        fscanf(fin, "%d%d%d", &t, &p1, &p2);
        if(t == 0)
        {
            r = query(1, 1, n);
            fprintf(fout, "%d%c", r, '\n');
        }
        else
        {
            update(1, 1, n);
        }
    }

    fclose(fin); fclose(fout);
    return 0;
}