#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <fstream>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

const int maxN = 1e5 + 5;

vector <int> aint(4 * maxN, 0);
vector <int> v(maxN, 0);

void build(int k, int l, int r) {
    if (l > r) return;
    if (l == r) {
        aint[k] = v[l];
        return;
    }

    int mid = (l + r) / 2;
    build(k * 2, l, mid);
    build(k * 2 + 1, mid + 1, r);
    aint[k] = max(aint[k * 2], aint[k * 2 + 1]);    
}

void update(int k, int l, int r, int poz, int newVal) {
    if (l > r) return;
    if (l == r) {
        aint[k] = newVal;
        return;
    }

    int mid = (l + r) / 2;
    
    if (poz <= mid)
        update(k * 2, l, mid, poz, newVal);
    else
        update(k * 2 + 1, mid + 1, r, poz, newVal);

    aint[k] = max(aint[k * 2], aint[k * 2 + 1]);
}

int query(int k, int l, int r, int L, int R) {
    if (L <= l && r <= R) {
        return aint[k];
    }

    int mid = (l + r) / 2;
    if (R <= mid)
        return query(k * 2, l, mid, L, R);
    else if(L > mid)
        return query(k * 2 + 1, mid + 1, r, L, R);
    else {
        return max(query(k * 2, l, mid, L, mid),
            query(k * 2 + 1, mid + 1, r, mid + 1, R));
    }
}

int main() {

    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    build(1, 1, n);

    for (int i = 1; i <= m; i++) {
        int t, a, b;
        fin >> t >> a >> b;

        if (t == 1) {
            update(1, 1, n, a, b);
        }
        else {
            fout << query(1, 1, n, a, b) << "\n";
        }
    }

    return 0;
}