#include <bits/stdc++.h>

using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int nmax = 100005;
int N,M;
int v[nmax],aint[4 * nmax];


inline void Build(int nod, int st, int dr)
{
    int mid = (st + dr) / 2;
    if(st == dr)
    {
        aint[nod] = v[st];
        return;
    }
    Build(2 * nod, st, mid);
    Build(2 * nod + 1, mid + 1, dr);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

inline void Update(int nod, int st, int dr, int p, int val)
{
    int mid = (st + dr) / 2;
    if(st == dr)
    {
        aint[nod] = val;
        return;
    }
    if(p <= mid) Update(2 * nod, st, mid, p, val);
    else Update(2* nod + 1, mid + 1, dr, p, val);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}


inline int Query(int nod, int st, int dr, int x, int y)
{
    int mid = (st + dr) / 2;
    if(st == x && dr == y)
    {
        return aint[nod];
    }
    if(y <= mid) return Query(2 * nod, st, mid, x, y);
    if(x > mid) return Query(2 * nod + 1, mid + 1, dr, x, y);
    return max(Query(2 * nod, st, mid, x, mid), Query(2 * nod + 1, mid + 1, dr, mid + 1, y));
}

int main()
{
    int i,a,b;
    fin >> N >> M;
    for(i = 1; i <= N; i++) fin >> v[i];
    Build(1, 1, N);
    while(M--)
    {
        fin >> i >> a >> b;
        if(i) Update(1, 1, N, a, b);
        else fout << Query(1, 1, N, a, b) << "\n";
    }
    return 0;
}