#include <bits/stdc++.h>
#define NN 100003
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");

int n, m, v[NN], aint[4 * NN];
void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        aint[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if(pos <= mid)
        update(nod * 2, st, mid, pos, val);
    else
        update(nod * 2 + 1, mid + 1, dr, pos, val);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

int query(int nod, int st, int dr, int qst, int qdr)
{
    if(qst <= st && dr <= qdr)
        return aint[nod];
    int mid = (st + dr) / 2;
    int a = 0, b = 0;
    if(qst <= mid)
        a = query(nod * 2, st, mid, qst, qdr);
    if(qst > mid)
        b = query(nod * 2 + 1, mid + 1, dr, qst, qdr);
    return max(a, b);
}

int main()
{
    fin >> n >> m;
    for(int i = 1 ; i <= n ; i++)
    {
        fin >> v[i];
        update(1, 1, n, i, v[i]);
    }
    for(int i = 1 ; i <= m ; i++)
    {
        int c, a, b;
        fin >> c >> a >> b;
        if(c == 0)
        {
            fout << query(1, 1, n, a, b) << '\n';
        }
        else
        {
            update(1, 1, n, a, b);
        }
    }
    return 0;
}