#include <fstream>

using namespace std;

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

int tree[400005];
int a[100005];

void recalculateNode(int node){
    tree[node] = max (tree[node * 2 + 1], tree[node * 2 + 2]);
}

void buildTree (int node, int l, int r){
    if (l > r)
        return;
    if (l == r){
        tree[node] = a[l];
        return;
    }
    int mid = (l + r) / 2;
    buildTree(node * 2 + 1, l, mid);
    buildTree(node * 2 + 2, mid + 1, r);
    recalculateNode(node);
}

void update (int node, int l, int r, int x, int y){
    if (l == r){
        tree[node] = y;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid){
        update(node * 2 + 1, l, mid, x, y);
    }
    else if (x >= mid + 1){
        update(node * 2 + 2, mid + 1, r, x, y);
    }
    recalculateNode(node);
}

int query (int node, int l, int r, int x, int y){
    if (x <= l and r <= y){
        return tree[node];
    }

    int mid = (l + r) / 2;
    int sol = -1;
    if (x <= mid){
        sol = max (sol, query(node * 2 + 1, l, mid, x, y));
    }
    if (mid + 1 <= y){
        sol = max (sol, query(node * 2 + 2, mid + 1, r, x, y));
    }
    return sol;
}

int main()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    buildTree(0, 1, n);

    while (q--){
        bool cerinta;
        int x, y;
        cin >> cerinta >> x >> y;

        if (cerinta){
            update(0, 1, n, x, y);
        }
        else{
            cout << query(0, 1, n, x, y) << '\n';
        }
    }

    return 0;
}