#include <bits/stdc++.h>
#define NM 200010
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
void read();
void solve();
int n, m, a[NM], v[NM];
void build(int nod, int st, int dr)
{
    if(st == dr)
        a[nod] = v[st];
    else
    {
        int mijl = (st+dr)/2;
        build(2*nod, st, mijl);
        build(2*nod+1, mijl+1, dr);
        a[nod] = max(a[2*nod], a[2*nod+1]);
    }
}
void update(int nod, int st, int dr, int x, int y)
{
    int mijl = (st+dr)/2;
    if(st == dr)
    {
        a[nod] = y;
        return ;
    }
    else if(x <= mijl)
        update(nod*2, st, mijl, x, y);
    else update(nod*2+1, mijl+1, dr, x, y);
    a[nod] = max(a[2*nod], a[2*nod+1]);
}
int query(int nod, int st, int dr, int x, int y)
{
    int ans = INT_MIN;
    if(x <= st && y >= dr)
        return a[nod];
    int mijl = (st+dr)/2;
    if(x <= mijl)
        ans = max(ans, query(2*nod, st, mijl, x, y));
    if(y >= mijl+1)
        ans = max(ans, query(2*nod+1, mijl+1, dr, x, y));
    return ans;
}
int main()
{
    read();
    solve();
    return 0;
}
void read()
{
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        fin >> v[i];
    build(1, 1, n);
}
void solve()
{
    int op, x, y;
    for(int q=1; q<=m; ++q)
    {
        fin >> op >> x >> y;
        if(op == 0)
            fout << query(1, 1, n, x, y) << '\n';
        else update(1, 1, n, x, y);
    }
}