#include <bits/stdc++.h>
#define NMAX 100004

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

int n, m;
int ST[4*NMAX];

void update(int nod, int left, int right, int poz, int val);
int query(int nod, int left, int right, int ql, int qr);

int main()
{
    int x, tip, a, b;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> x;
        update(1, 1, n, i, x);
    }

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

void update(int nod, int left, int right, int poz, int val)
{
    if (left == right)
    {
        ST[nod] = val;
        return;
    }
    int mid = (left + right) / 2;
    if (poz <= mid)
        update(2*nod, left, mid, poz, val);
    else
        update(2*nod+1, mid+1, right, poz, val);
    ST[nod] = max(ST[2*nod], ST[2*nod+1]);
}

int query(int nod, int left, int right, int ql, int qr)
{
    if (ql <= left && right <= qr)
        return ST[nod];
    int mid = (left + right) / 2;
    int m1 = 0, m2 = 0;
    if (ql <= mid)
        m1 = query(2*nod, left, mid, ql, qr);
    if (mid+1 <= qr)
        m2 = query(2*nod+1, mid+1, right, ql, qr);
    return max(m1, m2);
}