#include <bits/stdc++.h>

using namespace std;

ifstream fin ("arbint.in");
ofstream fout ("arbint.out");

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

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

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 pos, int val)
{
    if(left > right) {
        return ;
    }
    if(left == right) {
        tree[node] = val;
        return ;
    }
    int mid = (left + right) >> 1;
    if(pos <= mid) {
        update(left, mid, node * 2, pos, val);
    }
    else {
        update(mid + 1, right, node * 2 + 1, pos, 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;
    int ans1 = 0, ans2 = 0;
    if(x <= mid) {
        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()
{
    usain_bolt();

    int n, q;

    fin >> n >> q;
    for(int i = 1; i <= n; ++i) {
        fin >> a[i];
    }
    build(1, n, 1);
    for(; q; --q) {
        int type, x, y;

        fin >> type;
        if(type == 0) {
            fin >> x >> y;
            fout << query(1, n, 1, x, y) << "\n";
        }
        else {
            fin >> x >> y;
            update(1, n, 1, x, y);
        }
    }
    return 0;
}