#include <fstream>
#define mmm = (l + r) / 2

using namespace std;

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

int aint[400005];
int a[100005];

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

void buildTree (int node, int l, int r){
    if (l == r){
        aint[node] = a[l];
    }
    else{
        int mid mmm;
        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){
        aint[node] = y;
    }
    else{
        int mid mmm;
        if (x <= mid){
            update(node * 2 + 1, l, mid, x, y);
        }
        if (mid + 1 <= x){
            update(node * 2 + 2, mid + 1, r, x, y);
        }
        recalculateNode;
    }
}

int query (int node, int l, int r, int x, int y){
    if (r < x or y < l){
        return 1e9 + 1;
    }
    if (x <= l and r <= y){
        return aint[node];
    }
    else{
        int mid mmm;
        int sol = -1;
        if (x <= mid){
            sol = max (sol, query(node * 2 + 1, l, mid, x, y));
        }
        if (y >= mid + 1){
            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--){
        int type, x, y;
        cin >> type >> x >> y;
        if (type == 0){
            cout << query(0, 1, n, x, y) << '\n';
        }
        else{
            update(0, 1, n, x, y);
        }
    }

    return 0;
}