#include <iostream>
#include <fstream>

using namespace std;

ifstream fin ("arbint.in");
ofstream fout ("arbint.out");

const int NMAX = 1e5 + 3;

int N, M;
int v[NMAX];

class SegmentTree
{
    int aint[4 * NMAX];
private:
    int mymax(int a, int b)
    {
        return (a > b ? a : b);
    }

public:
    void Update(int node, int L, int R, int pos, int val)
    {
        if(L == R) {
            aint[node] = val;
            return;
        }

        int mid = ((L + R) >> 1);

        if(pos <= mid)
            Update(2 * node, L, mid, pos, val);
        else Update(2 * node + 1, mid + 1, R, pos, val);

        aint[node] = mymax(aint[2 * node], aint[2 * node + 1]);
    }

    int Query(int node, int L, int R, int qL, int qR)
    {
        if(qL <= L && R <= qR)
            return aint[node];

        int mid = ((L + R) >> 1);

        int max1 = 0, max2 = 0;
        if(qL <= mid)
            max1 = Query(2 * node, L, mid, qL, qR);
        if(qR > mid)
            max2 = Query(2 * node + 1, mid + 1, R, qL, qR);

        return mymax(max1, max2);
    }

}arb;

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= N; ++i) {
        int x;
        fin >> x;
        arb.Update(1, 1, N, i, x);
    }

    for(int i = 1; i <= M; ++i) {
        int cer, x, y;
        fin >> cer >> x >> y;
        if(cer == 1)
            arb.Update(1, 1, N, x, y);
        else fout << arb.Query(1, 1, N, x, y) << '\n';
    }

    return 0;
}