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

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

const int MAX_N = (1 << 17) + 100;

int v[MAX_N];
int tree[2 * MAX_N];

void build(int node, int le, int ri) {
    if(le == ri) {
        tree[node] = v[le];
        return;
    }

    int mid = (le + ri) / 2;
    build(node * 2, le, mid);
    build(node * 2 + 1, mid + 1, ri);

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

void update(int node, int le, int ri, int pos, int val) {
    if(le == ri) {
        tree[node] = val;
        return;
    }

    int mid = (le + ri) / 2;
    if(pos <= mid) {
        update(node * 2, le, mid, pos, val);
    }
    else {
        update(node * 2 + 1, mid + 1, ri, pos, val);
    }

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

int query(int node, int le, int ri, int qLe, int qRi) {
    if(qLe <= le && ri <= qRi) {
        return tree[node];
    }

    int mid = (le + ri) / 2;
    int ans = 0;

    if(qLe <= mid) {
        ans = max(ans, query(node * 2, le, mid, qLe, qRi));
    }
    if(qRi > mid) {
        ans = max(ans, query(node * 2 + 1, mid + 1, ri, qLe, qRi));
    }

    return ans;
}

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

    int p;
    for(p = 1; p < n; p *= 2);

    build(1, 1, p);

    for(int i = 1; i <= m; i++) {
        int t, a, b;
        fin >> t >> a >> b;
        if(t == 1) {
            update(1, 1, p, a, b);
        }
        else {
            fout << query(1, 1, p, a, b) << '\n';
        }
    }

    return 0;
}