#include <bits/stdc++.h>

const int NMAX = 1e5+8;

using namespace std;

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

int n, m;

int v[4 * NMAX];

void Update(int node, int left, int right, int a, int b) {
    if(left == right) { v[node] = b; return; }

    int mid = (left + right) / 2;
    if(mid >= a) Update(node * 2, left, mid, a, b);
    else Update(node * 2 + 1, mid + 1, right, a, b);

    v[node] = max(v[2 * node], v[2 * node + 1]);
}

int Query(int node, int left, int right, int a, int b) {
    if(a <= left && right <= b) return v[node];

    int mid = (left + right) / 2, v_left = 0, v_right = 0;
    if(a <= mid) v_left = Query(2 * node, left, mid, a, b);
    if(mid < b) v_right = Query(2 * node + 1, mid + 1, right, a, b);

    return max(v_left, v_right);
}

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; i ++) {
        int x; fin >> x;
        Update(1, 1, n, i, x);
    }

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

        if(task == 0) fout << Query(1, 1, n, a, b) << '\n';
        else Update(1, 1, n, a, b);
    }

    return 0;
}