#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");

const int NMAX = 100001;

int n, m, a[NMAX], t[4*NMAX];

void build(int node, int left, int right)
{
    if(left == right)
    {
        t[node] = a[right];
        return;
    }
    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    t[node] = max(t[2 * node], t[2 * node + 1]);
}

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

}

int query(int node, int left, int right, int st, int dr)
{
    if(st <= left && right <= dr)
    {
        return t[node];
    }
    int mid = (left + right) / 2;
    int x = 1e9, y = 1e9;
    if(st <= mid)
    {
        x = query(2 * node, left, mid, st, dr);
    }
    if(dr > mid)
    {
        y = query(2 * node + 1, mid + 1, right, st, dr);
    }
    if(x != 1e9 && y != 1e9)
        return max(x, y);
    if(x != 1e9)
        return x;
    if(y != 1e9)
        return y;

}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    build(1, 1, n);
    for(int i = 1; i <= m; i++)
    {
        int x, y, op;
        fin >> op >> x >> y;
        if(op == 0)
        {
            fout << query(1, 1, n, x, y) << '\n';
        }
        else
        {
            update(1, 1, n, x, y);
        }

    }
    return 0;
}