#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int inf = -1;
int n, m, aint[400000], op, a, b, v[100000];
void build(int node, int left, int right)
{
    if(left == right)
    {
        aint[node] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}
void makesegtree(int st, int dr, int node, int poz, int val)
{
    if (st == dr)
    {
        aint[node] = val;
        return;
    }
    int mij = (st + dr) / 2;
    if (poz <= mij)
        makesegtree(st, mij, node * 2, poz, val);
    else
        makesegtree(mij + 1, dr, node * 2 + 1, poz, val);
    aint[node] = max(aint[node * 2], aint[node * 2 + 1]);
}
int rmq(int st, int dr, int node, int a, int b)
{
    if (a <= st && b >= dr)
        return aint[node];
    int mij = (st + dr) / 2, r1 = -1, r2 = -1;
    if (a <= mij)
        r1 = rmq(st, mij, node * 2, a, b);
    if (b >= mij + 1)
        r2 = rmq(mij + 1, dr, node * 2 + 1, a, b);
    return max(r1, r2);
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i];
    }
    build(1, 1, n  );
    for (int i = 1; i <= m; i++)
    {
        cin >> op;
        if (op == 1)
        {
            cin >> a >> b;
            makesegtree(1, n, 1, a, b);
        }
        else
        {
            cin >> a >> b;
            cout << rmq(1, n, 1, a, b) << endl;
        }
    }
    return 0;
}