#include <fstream>

using namespace std;

int n, m, tree[400010], v[100010], p, val, a, b;

void build(int node, int left, int right)
{
    if (left == right)
    {
        tree[node] = v[left];
        return;
    }
    
    int mij = left + (right-left)/2;
    
    build(2*node, left, mij);
    build(2*node+1, mij+1, right);
    
    tree[node] = max(tree[2*node], tree[2*node+1]);
}

void update(int node, int left, int right)
{
    if (left == right)
    {
        tree[node] = val;
        return;
    }
    
    int mij = left + (right-left)/2;
    
    if (p <= mij)
        update(2*node, left, mij);
    else update(2*node+1, mij+1, right);
    
    tree[node] = max(tree[2*node], tree[2*node+1]);
}

void query(int node, int left, int right)
{
    if (a <= left && right <= b)
    {
        val = max(val, tree[node]);
        return;
    }
    
    int mij = left + (right-left)/2;
    
    if (a <= mij)
        query(2*node, left, mij);
    if (mij < b)
        query(2*node+1, mij+1, right);
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    build(1, 1, n);
    int op;
    for (int i = 0; i < m; ++i)
    {
        fin >> op;
        if (op == 0)
        {
            val = 0;
            fin >> a >> b;
            query(1, 1, n);
            fout << val << '\n';
        }
        else if (op == 1)
        {
            fin >> p >> val;
            update(1, 1, n);
        }
    }
    fin.close();
    fout.close();
    return 0;
}