#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int MaxArb[100001];

void Update(int nod, int start, int stop, int val, int pos)
{
    if (start == stop)
    {
        MaxArb[nod] = val;
        return;
    }

    int mid = (start + stop) / 2;

    if (pos <= mid)
        Update(nod * 2, start, mid, val, pos);
    else
        Update(nod * 2 + 1, mid + 1, stop, val, pos);

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

void Query(int nod, int start, int stop, int& maxim, int a, int b)
{
    if (a <= start && stop <= b)
    {
        maxim = max(maxim, MaxArb[nod]);
        return;
    }

    int mid = (start + stop) / 2;

    if (a <= mid)
        Query(2 * nod, start, mid, maxim, a, b);

    if (b > mid)
        Query(2 * nod + 1, mid + 1, stop, maxim, a, b);

}

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

    for (int i = 1; i <= n; i++)
    {
        int el;

        fin >> el;

        Update(1, 1, n, el, i);
    }

    for (int i = 1; i <= m; i++)
    {
        int c, a, b;

        fin >> c >> a >> b;

        if (c == 0)
        {
            int maxim = -1;
            Query(1, 1, n, maxim, a, b);

            fout << maxim << '\n';
        }
        else
        {
            Update(1, 1, n, b, a);
        }
    }

    fin.close();
    fout.close();
    return 0;
}