/*
 * A computer is like air conditioning - it becomes useless when you
 * open Windows.
 *      - Linus Torvalds
 */
#include <fstream>

const int MAX_NODES = 262143; // 2 ^ 0 + 2 ^ 1 + ... + 2 ^ [log2(MAX_N)]
const int MAX_N = 100000;

int aint[MAX_NODES];

void set(int n, int x, int node = 1, int l = 1, int r = MAX_N)
{
    if(l == r)
    {
        aint[node] = x;
        return;
    }

    int middle = (l + r) / 2;

    if(n <= middle)
        set(n, x, 2 * node, l, middle);
    else set(n, x, 2 * node + 1, middle + 1, r);

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

int query(int a, int b, int node, int l, int r )
{
    if(a <= l && r <= b)
        return aint[node];

    int middle = (l + r) / 2;
    int max = 0;

    if(a <= middle)
        max = query(a, b, 2 * node, l, middle);
    if(b > middle)
        max = std::max(
                max,
                query(a, b, 2 * node + 1, middle + 1, r)
                );

    return max;
}

int main()
{
    std::ifstream fin("arbint.in");
    std::ofstream fout("arbint.out");

    int n, m;

    fin >> n >> m;

    for(int i = 1; i <= n; i++)
    {
        int x;
        fin >> x;

        set(i, x, 1, 1, n);
    }

    for(int i = 0; i < m; i++)
    {
        int c, a, b;
        fin >> c >> a >> b;

        if(c == 0)
            fout << query(a, b, 1, 1, n) << '\n';
        else set(a, b, 1, 1, n);
    }

    return 0;
}