#include <bits/stdc++.h>

using namespace std;

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

#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
typedef long long ll;

const int NMAX = 1e5 + 30;
const int INF = 0x3f3f3f3f;

int n, m, op, a, b, x, ST[NMAX * 4];

void update(int index, int val, int node, int le, int ri)
{
    if (le == ri)
    {
        ST[node] = val;
        return;
    }
    int mid = (le + ri) / 2;

    if (index <= mid)
        update(index, val, 2 * node, le, mid);
    else
        update(index, val, 2 * node + 1, mid + 1, ri);

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

int query(int a, int b, int node, int le, int ri)
{
    if (a <= le && ri <= b) // inclus in intervalul cautat
        return ST[node];

    int mid = (le + ri) / 2, ans = 0;
    if (a <= mid)
        ans = max(ans, query(a, b, 2 * node, le, mid));
    if (mid + 1 <= b)
        ans = max(ans, query(a, b, 2 * node + 1, mid + 1, ri));

    return ans;
}

void read()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++)
        in >> x, update(i, x, 1, 1, n);
}

void solve()
{
    while (m--)
    {
        in >> op >> a >> b;
        if (!op)
            out << query(a, b, 1, 1, n) << '\n';
        else
            update(a, b, 1, 1, n);
    }
}

int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);

    read();
    solve();

    return 0;
}