#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;

int tree[4 * MAX];
int arrVal[MAX];

void build(int node, int st, int dr)
{
    if (st == dr)
    {
        tree[node] = arrVal[st];
        return;
    }
    int mid = (st + dr) / 2;

    build(2 * node, st, mid);
    build(2 * node + 1, mid + 1, dr);

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

void update(int node, int st, int dr, int pos, int val)
{
    if (st == dr)
    {
        tree[node] = val;
        return;
    }
    int mid = (st + dr) / 2;

    if (pos <= mid)
        update(2 * node, st, mid, pos, val);
    if (pos > mid)
        update(2 * node + 1, mid + 1, dr, pos, val);

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

int query(int node, int st, int dr, int x, int y)
{
    if (x <= st && dr <= y)
        return tree[node];

    int mid = (st + dr) / 2;
    int r1 = 0, r2 = 0;
    if (x <= mid)
        r1 = query(2 * node, st, mid, x, y);
    if (y > mid)
        r2 = query(2 * node + 1, mid + 1, dr, x, y);
    return max(r1, r2);
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    int N, M;
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        fin >> arrVal[i];
    }

    build(1, 1, N);
    int nr, a, b;
    while (M > 0)
    {
        fin >> nr >> a >> b;
        if (nr == 0)
        {
            int res = query(1, 1, N, a, b);
            fout << res << endl;
        }
        else
        {
            update(1, 1, N, a, b);
        }
        M--;
    }

    return 0;
}