#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 1e5 + 7;

int arb[4 * DIM];
int v[DIM];

void build(int poz,int l, int r)
{
    if(l == r)
    {
        arb[poz] = v[l];
        return ;
    }

    int mid = (l + r) / 2;

    build(2 * poz, l, mid);
    build(2 * poz + 1,mid + 1, r);

    arb[poz] = max(arb[poz * 2],arb[poz * 2 + 1]);

}

void update(int poz,int l, int r,int loc,int val)
{
    if(l == r)
    {
     arb[poz] = val;
     return ;
    }

    int mid = (l + r) / 2;

    if(loc <= mid)
        update(poz * 2, l, mid,loc,val);
    else
        update(poz * 2 + 1, mid + 1, r, loc, val);

    arb[poz] = max(arb[poz * 2],arb[poz * 2 + 1]);
}

int query(int poz,int l,int r,int st,int dr)
{
    if(st <= l && r <= dr)
        return arb[poz];

    int rez = 0;

    int mid = (l + r) / 2;

    if(st <= mid)
        rez = max(rez,query(poz * 2, l, mid, st, dr));

    if(mid < dr)
        rez = max(rez,(query(poz * 2 + 1, mid + 1, r, st, dr )));

    return rez;

}

int main()
{


    int n, m;
    in >> n >> m;

    for(int i = 1; i <= n ;i++)
        in >> v[i];


    build(1,1,n);

    while(m--)
    {
        int c, x, y;
        in >> c >> x >> y;

        if(c == 0)
            out << query(1, 1, n, x, y) <<'\n';
        else
            update(1, 1, n, x, y);
    }
    return 0;
}