#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin("arbint.in");
ofstream cout("arbint.out");

int tree[400010];
int A[100010];
int n, m;

void build(int node, int left, int right) {
    if (left == right) {
        tree[node] = A[left];
        return;
    }
    int mid = (left + right) / 2;
    build(node * 2, left, mid);
    build(node * 2 + 1, mid + 1, right);
    tree[node] = max(tree[node * 2], tree[node * 2 + 1]);
}

void update(int node, int left, int right, int pos, int val) {
    if (left == right) {
        tree[node] = val;
        return;
    }
    int mid = (left + right) / 2;
    if (pos <= mid)
        update(node * 2, left, mid, pos, val);
    else
        update(node * 2 + 1, mid + 1, right, pos, val);
    tree[node] = max(tree[node * 2], tree[node * 2 + 1]);
}

int query(int node, int left, int right, int ql, int qr) {
    if (ql <= left && right <= qr)
        return tree[node];
    int mid = (left + right) / 2;
    int res = 0;
    if (ql <= mid)
        res = max(res, query(node * 2, left, mid, ql, qr));
    if (qr > mid)
        res = max(res, query(node * 2 + 1, mid + 1, right, ql, qr));
    return res;
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> A[i];
    }
    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        int x, a, b;
        cin >> x >> a >> b;
        if (x == 0) {
            cout << query(1, 1, n, a, b) << '\n';
        } else {
            update(1, 1, n, a, b);
        }
    }
    return 0;
}