#include <iostream>
#include <fstream>

using namespace std;

#define MAXN 100005

int n, mx;
int aint[3 * MAXN];

void update(int poz, int nr, int st = 1, int dr = n, int node = 1)
{
    if (st == dr) {
        aint[node] = nr;
        return ;
    }

    int mij = ((st + dr) >> 1);
    if (poz <= mij) {
        update(poz, nr, st, mij, node << 1);
    } else {
        update(poz, nr, mij + 1, dr, (node << 1) + 1);
    }
    aint[node] = max(aint[node << 1], aint[(node << 1) + 1]);
}

void getSol(int a, int b, int st = 1, int dr = n, int node = 1)
{
    if (a <= st && dr <= b) {
        mx = max(mx, aint[node]);
        return ;
    }

    int mij = ((st + dr) >> 1);
    if (a <= mij) {
        getSol(a, b, st, mij, node << 1);
    }
    if (b > mij) {
        getSol(a, b, mij + 1, dr, (node << 1) + 1);
    }
}

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

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

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

        if (op == 1) update(x, y);
        if (op == 0) mx = 0, getSol(x, y), fprintf(g, "%d\n", mx);
    }

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