#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 100005;

int v[DIM], aint[4 * DIM];

void build(int node, int left, int right)
{
    if (left == right)
    {
        aint[node] = v[left];
        return;
    }

    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void update(int node, int left, int right, int pos, int val)
{
    if (left == right)
    {
        aint[node] = val;
        return;
    }
    int mid = (left + right) / 2;
    if (pos <= mid)
        update(2 * node, left, mid, pos, val);
    else
        update(2 * node + 1, mid + 1, right, pos, val);
    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];
    }

    int mid = (left + right) / 2;
    int res = -1000000000;
    if (qLeft <= mid)
        res = max(res, query(2 * node, left, mid, qLeft, qRight));
    if (qRight > mid)
        res = max(res, query(2 * node + 1, mid + 1, right, qLeft, qRight));

    return res;
}

int main()
{
    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= n; ++i)
        fin >> v[i];

    build(1, 1, n);

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

        if (op == 0)
            fout << query(1, 1, n, a, b) << "\n";
        else
            update(1, 1, n, a, b);
    }
    return 0;
}