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