#include <bits/stdc++.h>

using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int Nmax = 100000 + 5;
int arb[4 * Nmax], n, m, maxim, a[Nmax];
void update(int nod, int left, int right, int x, int poz)
{
    int mid = (left + (right - left) / 2);

    if(left == right)
    {
        arb[nod] = x;
        return;
    }
    if(poz <= mid)update(2 * nod, left, mid, x, poz);
    else update(2 * nod + 1, mid + 1, right, x , poz);
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}
void querie(int nod, int left, int right, int L, int R)
{
    int mid = (left + (right - left)/ 2);

    if(L > right || R < left)return;

    if(left <= L && right >= R)
    {
        maxim = max(maxim, arb[nod]);
        return;
    }
    querie(2 * nod, left, mid, L, R);
    querie(2 * nod + 1, mid + 1, right, L , R);

}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        fin >> a[i];
        update(1, 1, n, a[i], i);
    }
    for(int i = 1, vr,x , y; i <= m; ++i)
    {
        fin >> vr >> x >> y;
        maxim =0;
        if(!vr)querie(1, 1, n, x, y),fout << maxim << '\n';
        else update(1, 1, n, a[y], x);
    }
    return 0;
}