#include <fstream>
using namespace std;
ifstream fin ("arbint.in");
ofstream fout("arbint.out");

const int dim = 100002;
int n, v[4 * dim], w[dim];

int merge (int left_son, int right_son)
{
    //Calculam pe baza celor 2 fii
    int res = max(left_son, right_son);
    return res;
}

void construct (int nod,int l, int r)
{
    if (l == r)
    {
        v[nod] = w[r];
        return;
    }
    int mid = (l + r)/2;
    construct(2 * nod, l , mid);
    construct(2 * nod + 1, mid + 1, r);
    v[nod] = merge(v[2 * nod], v[2 * nod + 1]);
}

void update(int nod, int l, int r, int pos, int val)
{
    if (l == r)
    {
        v[nod] = val;
        return;
    }
    int mid = (l + r)/2;
    if (pos <= mid)
        update(2 * nod, l, mid, pos, val);
    else update(2 * nod + 1, mid + 1, r, pos, val);
    v[nod] = merge(v[2 * nod], v[2 * nod + 1]);
}


void update(int pos, int val)
{
    return update(1, 1, n, pos, val);
}


int query (int nod, int l, int r, int ql, int qr)
{
    if (qr < l || r < ql) ///Intervalul [l...r] nu are nicio intersectie cu cel de query
        return 0;

    if (ql <= l && r <= qr) ///Intervalul [l..r] cuprins complet in cel de query
        return v[nod];

    int mid = (l + r)/2;
    int left_son = query(2 * nod, l, mid, ql, qr);
    int right_son = query(2 * nod + 1, mid + 1, r, ql, qr);

    return merge(left_son, right_son);
}

int query(int ql, int qr)
{
    return query(1, 1, n, ql, qr);
}
int main()
{
    int q, op, x, y;
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
        fin >> w[i];

    construct (1, 1, n);

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