#include <iostream>
#include <fstream>
#define nmax 100000
using namespace std;

int n, m;
int a[nmax+10], tree[4*nmax+10];

void build_tree(int nod, int left, int right)
{
    if(left > right)
        return;

    if(left == right)
        tree[nod] = a[left];

    else
    {
        int mij = (left + right)/2;
        build_tree(2*nod, left, mij);
        build_tree(2*nod+1, mij+1, right);

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

void update(int nod, int left, int right, int poz, int val)
{
    if(left == right)
        tree[nod] = val, a[poz] = val;

    else
    {
        int mij = (left + right)/2;

        if(poz >= left && poz <= mij)
            update(2*nod, left, mij, poz, val);

        else
            update(2*nod+1, mij+1, right, poz, val);

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

int query(int nod, int left, int right, int left_cur, int right_cur)
{
    if(right < left_cur || left > right_cur)
        return 0;

    if(left >= left_cur && right <= right_cur)
        return tree[nod];

    int mij = (left + right)/2;
    return max(query(2*nod, left, mij, left_cur, right_cur), query(2*nod+1, mij+1, right, left_cur, right_cur));
}

void read()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");
    f >> n >> m;
    for(int i=1; i<=n; ++i)
        f >> a[i];

    build_tree(1, 1, n);

    for(int i=0, x, y, cod; i<m; ++i)
    {
        f >> cod >> x >> y;
        if(cod == 0)
            g << query(1, 1, n, x, y) << '\n';
        else
            update(1, 1, n, x, y);
    }
    f.close();
    g.close();
}

int main()
{
    read();
    return 0;
}