#include <bits/stdc++.h>

using namespace std;

const int DIM = 100000 + 5;

int tree[4 * DIM], a[DIM];

void build(int left, int right, int node)
{
    if(left > right) return ;

    if(left == right) {
        tree[node] = a[left];
        return ;
    }
    int mid = (left + right) >> 1;

    build(left, mid, node * 2);
    build(mid + 1, right, node * 2 + 1);

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

void update(int left, int right, int node, int place, int val)
{
    if(left > right) return ;

    if(left == right) {
        tree[node] = val;
        return ;
    }
    int mid = (left + right) >> 1;

    if(place <= mid) update(left, mid, node * 2, place, val);
    else update(mid + 1, right, node * 2 + 1, place, val);

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

int query(int left, int right, int node, int x, int y)
{
    if(left > right) return 0;

    if(left >= x && right <= y) {
        return tree[node];
    }
    int mid = (left + right) >> 1, ans1 = 0, ans2 = 0;

    if(mid >= x) ans1 = query(left, mid, node * 2, x, y);
    if(mid + 1 <= y) ans2 = query(mid + 1, right, node * 2 + 1, x, y);

    return max(ans1, ans2);
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    int n, q;

    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);

    build(1, n, 1);

    for(int i = 1; i <= q; ++i) {
        int type, a, b;

        scanf("%d%d%d", &type, &a, &b);

        if(type == 1) update(1, n, 1, a, b);
        else printf("%d\n", query(1, n, 1, a, b));
    }
    return 0;
}