#include <bits/stdc++.h>

using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int Nmax = 4 * 100010;
int a[Nmax];
int n, m, ans;
void upd(int nod , int left, int right, int poz ,int x)
{
    int mid = left + (right - left) / 2;

    if(left == right)
    {
        a[nod] = x;
        return;
    }
    else if(poz <= mid)upd(2 * nod, left , mid, poz, x);
    else upd(2 * nod + 1, mid + 1, right, poz, x);

    a[nod] = max(a[2 * nod], a[2 * nod + 1]);
}
void query(int nod, int left , int right, int L, int R)
{
    int mid = left + (right - left) / 2;

    if(L <= left && right <= R)
    {
        ans = max (ans , a[nod]);
        return;
    }

    if(R < left || L > right)return;

    query(2 * nod, left, mid, L, R);
    query(2* nod + 1, mid + 1, right, L, R);
}
int main()
{
    fin >> n >> m;
    for(int i = 1, x; i <= n; ++i)
    {
        fin >> x;
        upd(1, 1 , n , i , x);
    }
    for(int i = 1,q ,a , b; i <= n; ++i)
    {
        fin >> q >> a >> b;
        if(q == 0)
        {
            ans = 0;
            query(1, 1 , n, a , b);
            fout << ans << '\n';
        }
        else upd(1, 1 , n, a , b);
    }
    return 0;
}