#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 1e5+5;
int n, m, arr[NMAX], segtree[4*NMAX], ans;

inline void update(int node, int st, int dr, int poz, int val)
{
    if(st == dr)
    {
        segtree[node] = val;
        return;
    }
    int mid = (st+dr)/2;
    if(poz <= mid)
    {
        update(node*2, st, mid, poz, val);
    }
    else
    {
        update(node*2+1, mid+1, dr, poz, val);
    }
    segtree[node] = max(segtree[node*2], segtree[node*2+1]);
}

inline void query(int node, int ArbSt, int ArbDr, int st, int dr)
{
    if(ArbDr < st || ArbSt > dr)
        return;
    if(ArbDr<=dr && ArbSt>=st)
    {
        ans = max(ans, segtree[node]);
        return;
    }
    int mid = (ArbSt+ArbDr)/2;
    query(node*2, ArbSt, mid, st, dr);
    query(node*2+1, mid+1, ArbDr, st, dr);
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;++i)
    {
        fin >> arr[i];
        update(1,1,n,i,arr[i]);
    }
    bool x;
    int a, b;
    while(m--)
    {
        fin >> x >> a >> b;
        if(x == 0)
        {
            ans = 0;
            query(1,1,n,a,b);
            fout << ans << '\n';
        }
        else
        {
            update(1,1,n,a,b);
        }
    }
}