#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100000 + 5;

int n, m;
int v[NMAX], aint[5 * NMAX];

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]);
}

void update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr && st == poz)
    {
        aint[nod] = val;
        return;
    }

    int mijl = (st + dr) / 2;
    if (poz <= mijl) update(2 * nod, st, mijl, poz, val);
    else update(2 * nod + 1, mijl + 1, dr, poz, val);

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

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

    int ans1 = 0, ans2 = 0;
    int mijl = (st + dr) / 2;

    if (a <= mijl) ans1 = query(2 * nod, st, mijl, a, b);
    if (b > mijl) ans2 = query(2 * nod + 1, mijl + 1, dr, a, b);

    return max(ans1, ans2);
}

void read()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
}

int main()
{
    int cod, x, y;

    read();
    build(1, 1, n);

    while (m--)
    {
        fin >> cod >> x >> y;
        if (cod == 0) fout << query(1, 1, n, x, y) << '\n';
        else update(1, 1, n, x, y);
    }

    return 0;
}