#include <bits/stdc++.h>

using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int nmax = 100002;
void build(int nod, int st, int dr);
void update(int poz, int val, int nod, int st, int dr);
int query(int nod, int st, int dr, int l, int r);

int aint[4*nmax], v[nmax], n, m;

int main()
{
    fin>>n>>m;
    for(int i = 1; i <= n; ++i)
        fin>>v[i];
    build(1, 1, n);
    while(m--)
    {
        int tip, a, b;
        fin>>tip>>a>>b;
        if(tip == 0)
            fout<<query(1, 1, n, a, b)<<"\n";
        else
            update(a, b, 1, 1, n);
    }




    return 0;
}

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

    int mijl = (st + dr) / 2, ans = 0;
    if(l <= mijl)
        ans = max(ans, query(2*nod, st, mijl, l, r));
    if(r > mijl)
        ans = max(ans, query(2*nod+1, mijl+1, dr, l, r));
    return ans;
}
void update(int poz, int val, int nod, int st, int dr)
{
    if(st == dr)
    {
        aint[nod] = val;
        return;
    }
    int mijl = (st + dr) / 2;
    if(poz <= mijl)
        update(poz, val, 2*nod, st, mijl);
    else
        update(poz, val, 2*nod+1, mijl+1, dr);
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}

void build(int nod, int st, int dr)
{
    if(st == dr)
    {
        aint[nod] = v[st];
        return;
    }
    int mijl = (st + dr) / 2;
    build(2*nod, st, mijl);
    build(2*nod+1, mijl+1, dr);
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}