#include <bits/stdc++.h>

#define DIM 100010

using namespace std;

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

int v[4 * DIM], N, M, x;
int solution;

void update(int node, int st, int dr, int poz, int x)
{
    if(st == dr)
    {
        v[node] = x;
        return;
    }

    int middle = (st + dr) >> 1;

    if(poz <= middle)
    {
        update(2 * node, st, middle, poz, x);
    }
    else
    {
        update(2 * node + 1, middle + 1, dr, poz, x);
    }
    v[node] = max(v[2 * node], v[2 * node + 1]);
}

void query(int node,int st, int dr, int a, int b)
{
    if(a <= st && dr <= b)
    {
        solution = max(solution, v[node]);
        return;
    }

    int middle = (st + dr) >> 1;
    if(a <= middle)
    {
        query(2 * node, st, middle, a, b);
    }
    if(b > middle)
    {
        query(2 * node + 1, middle + 1, dr, a, b);
    }

}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= N; i ++)
    {
        fin >> x;
        update(1, 1, N, i, x);
    }

    for(int i = 1; i <= M; i ++)
    {
        int op, a, b;
        fin >> op >> a >> b;
        if(op)
        {
            update(1, 1, N, a, b);
        }
        else
        {
            solution = 0;
            query(1, 1, N, a, b);
            fout << solution << '\n';
        }
    }

    return 0;
}