#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;

#define maxNr 100001
int tree[4* maxNr];
int v[maxNr];

void buildTree(int index, int st, int dr) {
    //in cazul in care intervalul are un singur numar: ex [3,3] = 3
    if (st == dr) {
        tree[index] = v[dr];
        return;
    }
    //calculam mijlocul intervalului actual
    int m = (st + dr) / 2;
    //construim subtree-ul stang si subtree-ul drept
    buildTree(2 * index + 1, st, m);
    buildTree(2 * index + 2, m + 1, dr);
    //tree[index] retine maximul intervalului fiilor
    tree[index] = max(tree[2 * index + 1], tree[2 * index + 2]);
}

void updateTree(int index, int a, int b, int st, int dr) {
    if (st == dr) {
        tree[index] = b;
        return;
    }
    int m = (st + dr) / 2;
    if(a <= m)
        updateTree(2 * index + 1, a, b, st, m);
    else
        updateTree(2 * index + 2, a, b, m + 1, dr);
    tree[index] = max(tree[2 * index + 1], tree[2 * index + 2]);
}

int querySegTree(int index, int st, int dr, int a, int b)
{
    // segment completely outside range
    if (st > a || dr < b)
        return 0;

    // segment completely in range
    if (a <= st && dr <= b)
        return tree[index];

    //partial overlap
    int m = st + (dr - st) / 2;
    if (a > m)
        return querySegTree(2 * index + 2, m + 1, dr, a, b);
    else if (b <= m)
        return querySegTree(2 * index + 1, st, m, a, b);

    int leftQuery = querySegTree(2 * index + 1, st, m, a, m);
    int rightQuery = querySegTree(2 * index + 2, m + 1, dr, m + 1, b);

    return max(leftQuery, rightQuery);
}



int main()
{
    int n, m, a, b, x;
    ifstream in("arbint.in");
    ofstream out("arbint.out");
    in >> n >> m;

    for (int i = 0; i < n; i++)
        in >> v[i];

    //construim arborele de intervale pe baza lui v
    buildTree(0, 0, n - 1);

    for (int i = 0; i < m; i++) {
        in >> x >> a >> b;
        if (x == 1)
            updateTree(0, a - 1, b, 0, n - 1);
        if (x == 0)
            out << querySegTree(0, 0, n - 1, a - 1, b - 1) << "\n";
    }
}