#include <bits/stdc++.h>

using namespace std;

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

const int N_MAX = 100000;

int tree[4 * N_MAX + 5];
int V[N_MAX + 5];

void build(int node, int le, int ri)
{
    if (le == ri)
    {
        tree[node] = V[le];
        // cout << "le: " << le << "\n";
        return;
    }

    int mid = (le + ri) / 2;

    build(2 * node, le, mid);
    build(2 * node + 1, mid + 1, ri);

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

void update(int node, int le, int ri, int pos, int val)
{
    if (le == ri)
    {
        tree[node] = val;
        return;
    }

    int mid = (le + ri) / 2;

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

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

void query(int node, int le, int ri, int x, int y, int &ans)
{
    if (x <= le && ri <= y)
    {
        ans = max(ans, tree[node]);
        return;
    }

    int mid = (le + ri) / 2;

    if (x <= mid)
    {
        query(2 * node, le, mid, x, y, ans);
    }
    if (y > mid)
    {
        query(2 * node + 1, mid + 1, ri, x, y, ans);
    }
}

int main()
{
    int n, operatii;
    in >> n >> operatii;

    for (int i = 1; i <= n; ++i)
        in >> V[i];
    build(1, 1, n);

    // for (int i = 1; i <= 9; ++i)
    //     cout << tree[i] << " ";
    // cout << "\n";

    while (operatii >= 1)
    {
        int op, a, b;
        in >> op >> a >> b;
        if (op == 0)
        {
            int answ = 0;
            query(1, 1, n, a, b, answ);
            
            out << answ << "\n";
        }
        else
        {
            update(1, 1, n, a, b);
            // for (int i = 1; i <= 9; ++i)
            //     cout << tree[i] << " ";
            // cout << "\n";
        }

        --operatii;
    }
}