#include <bits/stdc++.h>

#define n_max 100000

using namespace std;

int n, m, tree[n_max * 4 + 5];
int a[n_max + 5];

void build(int node, int l, int r) {
    if(l == r)
        tree[node] = a[l];
    else {
        int mid = (l + r) / 2;
        build(2 * node, l, mid);
        build(2 * node + 1, mid +1, r);

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

void update(int node, int l, int r, int pos, int val) {
    if(l == r)
        tree[node] = val;
    else {
        int mid = (l + r) / 2;
        if(pos <= mid) {
            update(2 * node, l, mid, pos, val);
        }
        else
            update(2 * node + 1, mid + 1, r, pos, val);
        tree[node] = max(tree[2*node], tree[2*node+1]);
    }
}

void query(int node, int l, int r, int x, int y, int &a) {
    if(x <= l && r <= y) {
        a = max(a, tree[node]);
        return;
    }
    int mid = (l + r) / 2;
    if(x <= mid)
        query(node * 2, l, mid, x, y, a);
    if(y > mid)
        query(node * 2 + 1, mid+1, r, x, y, a);

}

int main() {
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    
    build(1, 1, n);

    for(int i = 0; i < m; i++) {
        int op, l, r, a = 0;
        scanf("%d %d %d", &op, &l, &r);
        if(op) update(1, 1, n, l, r);
        else {
            query(1, 1, n, l, r, a);
            printf("%d\n", a);
        }
    }
}