#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>

#define NMAX 100005

using namespace std;

int poz, val;
int a, b;
int tree[NMAX << 2];

void Update(int node, int st, int dr)
{
    if (st >= dr)
    {
        tree[node] = val;
        return;
    }

    int mij = st + ((dr - st) >> 1);
    if (poz <= mij)
        Update(2 * node, st, mij);
    else
        Update(2 * node + 1, mij + 1, dr);

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

int Query(int node, int st, int dr)
{
    if (a <= st && dr <= b) return tree[node];

    int mij = st + ((dr - st) >> 1);
    int resLeft = 0, resRight = 0;
    if (a <= mij) resLeft = Query(2 * node, st, mij);
    if (b > mij) resRight = Query(2 * node + 1, mij + 1, dr);

    return max(resLeft, resRight);
}


int main()
{
    //memset(tree, 0, sizeof(tree));

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

    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= n; ++i)
    {
        fin >> val;
        poz = i;

        Update(1, 1, n);
    }
    for (int i = 1; i <= m; ++i)
    {
        int t;
        fin >> t >> a >> b;
        if (t == 0)
            fout << Query(1, 1, n) << '\n';
        else{
            poz = a;
            val = b;
            Update(1, 1, n);
        }
    }
    return 0;
}