#include <fstream>

using namespace std;

ifstream in("arbint.in");
ofstream out("arbint.out");
int n, m;
int v[100005];
int aint[400005];

void build(int node, int left, int right)
{
    if(left == right)
    {
        aint[node] = v[left];
    }
    else
    {
        int m = (left + right) / 2;

        build(2*node, left, m);
        build(2*node+1, m+1, right);

        aint[node] = max(aint[2*node], aint[2*node+1]);
    }
}

void update(int node, int left, int right, int poz, int newval)
{
    if(left == right)
    {
        aint[node] = newval;
    }
    else
    {
        int m = (left + right) / 2;

        if(poz <= m)
        {
            update(2 * node, left, m, poz, newval);
        }
        else
        {
            update(2 * node + 1, m+1, right, poz, newval);
        }

        aint[node] = max(aint[2*node], aint[2*node+1]);
    }
}

int query(int node, int left, int right, int qleft, int qright)
{
    if(qleft <= left && right <= qright)
    {
        return aint[node];
    }
    else
    {
        int m = (left + right) / 2;

        if(qright <= m)
        {
            return query(2*node, left, m, qleft, qright);
        }
        else if(m+1 <= qleft)
        {
            return query(2*node+1, m+1, right, qleft, qright);
        }

        return max(query(2*node, left, m, qleft, qright), query(2*node+1, m+1, right, qleft, qright));
    }
}

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

    build(1, 1, n);

    int c, a, b;
    while(m--)
    {
        in>>c>>a>>b;

        if(c == 0)
        {
            out<<query(1, 1, n, a, b)<<'\n';
        }
        else
        {
            update(1, 1, n, a, b);
        }
    }

    return 0;
}