#include <cstdio>
#include <algorithm>
#define NMAX 200010

using namespace std;
int m, n, a[NMAX],pozitie_a[NMAX], nrpa;

void adaugare(int nod, int st, int dr, int poz, int val)
{
    if(st == dr)
    {
        a[nod] = val;
        pozitie_a[++nrpa] = nod;
    }
    else
    {
        int mijl = (st+dr)/2;
        if(poz <= mijl)
            adaugare(nod*2, st, mijl, poz, val);
        else
            adaugare(nod*2+1, mijl+1, dr, poz, val);
        a[nod] = (a[nod*2+1]>a[nod*2])? a[nod*2+1]:a[nod*2];
    }
}

int maxim_interval(int poz, int st, int dr, int x, int y)
{
    if(st == dr)
        return a[poz];
    else
    {
        int mijl = (st+dr)/2;
        int a = 0, b = 0;
        if(x <= mijl)
            a = maxim_interval(2*poz, st, mijl, x, y);
        if(y > mijl)
            b = maxim_interval(2*poz+1, mijl+1, dr, x, y);
        return max(a, b);
    }
}
int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    int cod, x, y;
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        adaugare(1,1,n,i,x); /// nr in 'heap', interval ,...
    }
    for(int i = 1; i <= m; i++)
    {
        scanf("%d %d %d", &cod, &x, &y);
        if(cod == 0)
            printf("%d\n", maxim_interval(1,1,n,x,y));
        else
            a[pozitie_a[x]] = y;
    }
    return 0;
}