#include <bits/stdc++.h>
using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");


const int N = 100001;
int n, m, arb[4 * N];

int Query(int node, int st, int dr, int l, int r)
{
    if(l <= st && dr <= r)
        return arb[node];

    int mij = (st + dr) / 2, Q1 = -1e9, Q2 = -1e9;

    if(l <= mij)
         Q1 = Query(node * 2, st, mij, l, r);
    if(r > mij)
         Q2 = Query(node * 2 + 1, mij + 1, dr, l, r);

    return max(Q1, Q2);
}

void BuildArbore(int node, int st, int dr, int index, int val)
{
    if(st == dr)
    {
        arb[node] = val;
        return;
    }
    int mij = (st + dr) / 2;
    if(index <= mij)
        BuildArbore(node * 2 , st, mij, index, val);
    else
        BuildArbore(node * 2 + 1, mij + 1, dr, index, val);

    arb[node] = max(arb[node * 2], arb[node * 2 + 1]);
}

int main()
{
    int i, op, a, b, x;
    f >> n >> m;
    for(i = 0; i < n; i++)
    {
        f >> x;
        BuildArbore(1, 0, n - 1, i, x);
    }
    for(i = 0; i < m; i++)
    {
        f >> op >> a >> b;
        if(op == 0)
            g << Query(1, 0, n - 1, a - 1, b - 1) << '\n';
        else if(op == 1)
            BuildArbore(1, 0, n - 1, a - 1, b);
    }
    return 0;
}