#include <bits/stdc++.h>
#define Nmax 100001

using namespace std;

int a[4 * Nmax + 10], N, Q;

inline void Update(int p, int x)
{
    p += N - 1;
    a[p] = x;
    while(p > 0)
    {
        if(p & 1) p--;
        int t = p >> 1;
        a[t] = max(a[p], a[p + 1]);
        p = t;
    }
}

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

inline void Solve()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");
    int n1, i, p, x, y, T;
    f >> n1 >> Q;
    N = 1;
    while(N < n1)
        N *= 2;
    p = N;
    for(i = 1; i <= n1; i++)
        f >> a[p++];
    for(i = N - 1; i > 0; i--)
        a[i] = max(a[i * 2], a[i * 2 + 1]);
    for(i = 1; i <= Q; i++)
    {
        f >> T >> x >> y;
        if(T == 0)
            g << Query(1, x, y, 1, N) << "\n";
        else
            Update(x, y);
    }
    f.close();
}

int main()
{
    Solve();
    return 0;
}