#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
vector<int> tree(100000);

void buildTree(vector<int>& v, int index, int l, int r) {
    if (l == r) {
        tree[index] = v[r];
        return;
    }

    int mid = (l + r) / 2;
    buildTree(v, 2 * index + 1, l, mid);
    buildTree(v, 2 * index + 2, mid + 1, r);

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

void updateTree(vector<int>& v, int index, int a, int b, int l, int r) {
    if (l == r) {
        tree[index] = b;
        return;
    }
    int mid = (l + r) / 2;
    if(a <= mid)
        updateTree(v, 2 * index + 1, a, b, l, mid);
    else
        updateTree(v, 2 * index + 2, a, b, mid+1, r);
    tree[index] = max(tree[2 * index + 1], tree[2 * index + 2]);
}

int querySegTree(int index, int l, int r, int a, int b)
{   
    // segment completely outside range
    if (l > a || r < b)               
        return 0;    

    // segment completely inside range
    if (a <= l && b >= r)             
        return tree[index];

    //partial overlap
    int mid = l + (r - l) / 2;
    if (a > mid)
        return querySegTree(2 * index + 2, mid + 1, r, a, b);
    else if (b <= mid)
        return querySegTree(2 * index + 1, l, mid, a, b);

    int leftQuery = querySegTree(2 * index + 1, l, mid, a, mid);
    int rightQuery = querySegTree(2 * index + 2, mid + 1, r, mid + 1, b);

    return max(leftQuery, rightQuery);
}



int main()
{
    vector<int> v;
    int n, m, a, b, x;
    ifstream in("arbint.in");
    ofstream out("arbint.out");
    in >> n >> m;
    for (int i = 0; i < n; i++) {
        in >> x;
        v.push_back(x);
    }
    buildTree(v, 0, 0, n - 1);

    for (int i = 0; i < m; i++) {
        in >> x >> a >> b;
        if (x == 1) {
            updateTree(v, 0, a-1, b-1, 0, n - 1);
        }
        if (x == 0) {
            out<<querySegTree(0, 0, n - 1, a-1, b-1)<<'\n';
        }

    }
}