#include <iostream>
#include <fstream>

using namespace std;

#define MAXN 100005

FILE* f = fopen("arbint.in", "r");
FILE* g = fopen("arbint.out", "w");

int n, m, sol;
int AINT[3 * MAXN];

void update(int nod, int st, int dr, int pos, int nr)
{
    if (st == dr)
    {
        AINT[nod] = nr;
        return;
    }

    int mij = (st + dr) / 2;

    if (pos <= mij) {
        update(2 * nod, st, mij, pos, nr);
    } else {
        update(2 * nod + 1, mij + 1, dr, pos, nr);
    }

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

void query(int nod, int st, int dr, int a, int b)
{
    if (a <= st && dr <= b) {
        sol = max(sol, AINT[nod]);
        return;
    }

    int mij = (st + dr) / 2;
    if (a <= mij) {
        query(2 * nod, st, mij, a, b);
    }
    if (b > mij) {
        query(2 * nod + 1, mij + 1, dr, a, b);
    }
}

int main()
{
    fscanf(f, "%d %d\n", &n, &m);
    for (int i = 1; i <= n; i++) {
        int x; fscanf(f, "%d ", &x);
        update(1, 1, n, i, x);
    }

    for (int i = 1; i <= m; i++) {
        int op; fscanf(f, "%d ", &op);

        if (op == 1) {
            int pos; fscanf(f, "%d ", &pos);
            int nr; fscanf(f, "%d\n", &nr);
            update(1, 1, n, pos, nr);
        } else {
            int a; fscanf(f, "%d ", &a);
            int b; fscanf(f, "%d\n", &b);
            sol = 0;
            query(1, 1, n, a, b);
            fprintf(g, "%d\n", sol);
        }
    }

    fclose(f);
    fclose(g);
    return 0;
}