#include <fstream>
#define MAX 100000
using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
int v[MAX + 10], segmTree[4 * MAX + 10];
void build(int node, int left, int right)
{
    if (left == right)
        segmTree[node] = v[left];
    else
    {
        int mid = (left + right) / 2;
        build(2 * node, left, mid);
        build(2 * node + 1, mid + 1, right);
        segmTree[node] = max(segmTree[2 * node], segmTree[2 * node + 1]);
    }
}
void update(int node, int left, int right, int pos, int val)
{
    if (left == right)
        segmTree[node] = val;
    else
    {
        int mid = (left + right) / 2;
        if (pos <= mid)
            update(2 * node, left, mid, pos, val);
        else
            update(2 * node + 1, mid + 1, right, pos, val);
        segmTree[node] = max(segmTree[2 * node], segmTree[2 * node + 1]);
    }
}
int query(int node, int left, int right, int x, int y)
{
    if (x <= left && right <= y)
        return segmTree[node];
    else
    {
        int mid = (left + right) / 2;
        int maxL = 0, maxR = 0;
        if (x <= mid)
            maxL = query(2 * node, left, mid, x, y);
        if (mid < y)
            maxR = query(2 * node + 1, mid + 1, right, x, y);
        return max(maxL, maxR);
    }
}
int main()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    build(1, 1, n);
    for (int i = 1; i <= q; i++)
    {
        int type;
        cin >> type;
        if (type == 0)
        {
            int x, y;
            cin >> x >> y;
            cout << query(1, 1, n, x, y) << '\n';
        }
        else
        {
            int pos, val;
            cin >> pos >> val;
            update(1, 1, n, pos, val);
        }
    }
    return 0;
}