#include <fstream>
#include <vector>
using namespace std;

using VI = vector<int>;

int n, m;
VI tree;

void update(int pos, int val, int node, int a, int b);
int query(int left, int right, int node, int a, int b);

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    tree = VI(4 * n + 5);
    
    int x;
    for (int i = 1; i <= n; ++i)
    {
        fin >> x;
        update(i, x, 0, 1, n + 1);
    }

    int q, a, b;
    while (m--)
    {
        fin >> q >> a >> b;
        if (q == 1)
        {
            update(a, b, 0, 1, n + 1);
        }
        else
        {
            fout << query(a, b + 1, 0, 1, n + 1) << '\n';
        }
    }
}

void update(int pos, int val, int node, int a, int b)
{
    if (b - a == 1)
    {
        tree[node] = val;
        return;
    }
    
    int mid = (a + b) / 2;
    if (pos < mid)
        update(pos, val, 2 * node + 1, a, mid);
    else
        update(pos, val, 2 * node + 2, mid, b);
    tree[node] = max(tree[2 * node + 1], tree[2 * node + 2]);
}

int query(int left, int right, int node, int a, int b)
{
    if (b - a == 1)
    {
        return tree[node];
    }
    
    int mid = (a + b) / 2;
    int res = 0;
    if (left < mid)
        res = max(res, query(left, right, 2 * node + 1, a, mid));
    if (right > mid)
        res = max(res, query(left, right, 2 * node + 2, mid, b));
    
    return res;
}