#include <cstdio>
#include <iostream>

using namespace std;
FILE* f, * g;

int ar[1 << 19];
int poz, x, a, b, val;

void caut(int nod, int st, int dr)
{
    if (a <= st && dr <= b)
        val = max(val, ar[nod]);
    else
    {
        int mij = (st + dr) / 2;
        if (a <= mij)
            caut(2 * nod, st, mij);
        if (mij < b)
            caut(2 * nod + 1, mij + 1, dr);
    }
}
void update(int nod, int st, int dr)
{
    int mij;
    if (st == dr)
        ar[nod] = x;
    else
    {
        mij = (st + dr) / 2;
        if (poz <= mij)
            update(2 * nod, st, mij);
        else
            update(2 * nod + 1, mij + 1, dr);
        ar[nod] = max(ar[2 * nod], ar[2 * nod + 1]);
    }
}
int main()
{
    f = fopen("arbint.in", "r");
    g = fopen("arbint.out", "w");
    int n, m;
    fscanf(f, "%d %d", &n, &m);
    for (int i = 1;i <= n;++i)
    {
        fscanf(f, "%d", &x);
        poz = i;
        update(1, 1, n);
    }
    int p;
    for (int i = 1;i <= m;++i)
    {
        fscanf(f, "%d %d %d", &p, &a, &b);
        if (p == 1)
        {
            poz = a;
            x = b;
            update(1, 1, n);
        }
        else
        {
            val = 0;
            caut(1, 1, n);
            fprintf(g, "%d\n", val);
        }
    }
    fclose(f);
    fclose(g);
    return 0;
}