#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int NMAX = 1e5 + 5, INF = 2e9;
int n, q, a[NMAX];

struct SegmentTree
{
    int T[4 * NMAX];
    void build(int node, int st, int dr)
    {
        if(st == dr)
        {
            T[node] = a[st];
            return;
        }
        int mid = (st + dr) / 2;
        build(2 * node, st, mid);
        build(2 * node + 1, mid + 1, dr);
        T[node] = max(T[2 * node], T[2 * node + 1]);
    }

    void update(int poz, int val, int node = 1, int st = 1, int dr = n)
    {
        if(st == dr)
        {
            T[node] = val;
            a[st] = val;
            return;
        }
        int mid = (st + dr) / 2;
        if(poz <= mid)
            update(poz, val, 2 * node, st, mid);
        else
            update(poz, val, 2 * node + 1, mid + 1, dr);
        T[node] = max(T[2 * node], T[2 * node + 1]);
    }

    int query(int l, int r, int node = 1, int st = 1, int dr = n)
    {
        if(r < st || dr < l)
            return -INF;
        if(l <= st && dr <= r)
            return T[node];
        int mid = (st + dr) / 2;
        return max(query(l, r, 2 * node, st, mid), query(l, r, 2 * node + 1, mid + 1, dr));
    }
};
SegmentTree st;

signed main()
{
    fin >> n >> q;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    st.build(1, 1, n);
    while(q--)
    {
        int op, a, b;
        fin >> op >> a >> b;
        if(op == 0)
            fout << st.query(a, b) << "\n";
        else
            st.update(a, b);
    }

    return 0;
}