#include <bits/stdc++.h>
 
using namespace std;
 
ifstream in("arbint.in");
ofstream out("arbint.out");

const int Nmax = 1e5 + 5;

int a[Nmax], aint[2 * Nmax + 5];

void buildTree(int node, int left, int right) {
    if(left == right) {
        aint[node] = a[left];
        return;
    }

    int mid = (left + right) / 2;

    buildTree(2 * node, left, mid);
    buildTree(2 * node + 1, mid + 1, right);

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

int query(int node, int left, int right, int a, int b) {
    if(a <= left && b >= right) {
        return aint[node];
    }

    if(a > right || b < left) {
        return INT_MIN;
    }

    int mid = (left + right) / 2;
    int max1 = query(2 * node, left, mid, a, b);
    int max2 = query(2 * node + 1, mid + 1, right, a, b);

    return max(max1, max2);
}

void update(int node, int left, int right, int idx, int val) {
    if(left == right) {
        a[idx] = val;
        aint[node] = val;
        return;
    }

    int mid = (left + right) / 2;
    if(idx >= left && idx <= mid) {
        update(2 * node, left, mid, idx, val);
    } else {
        update(2 * node + 1, mid + 1, right, idx, val);
    }

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

int main() {
    ios::sync_with_stdio(false); in.tie(0); out.tie(0);

    int n, m; in >> n >> m;
    for(int i = 1; i <= n; ++i) {
        in >> a[i];
    }

    buildTree(1, 1, n);

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

        if(op == 0) {
            out << query(1, 1, n, a, b) << "\n";
        } else {
            update(1, 1, n, a, b);
        }
    }

    in.close(); out.close();
 
    return 0;
}