#include <fstream>

using namespace std;

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

const int NMAX = 1e5;
int n, m;
int a[NMAX + 1];
int aint[4 * NMAX + 1];

void Build(int node, int left, int right)
{
    if(left == right)
        aint[node] = a[left];
    else
    {
        int mid = (left + right) / 2;
        Build(node * 2, left, mid);
        Build(node * 2 + 1, mid + 1, right);
        aint[node] = max(aint[node * 2], aint[node * 2 + 1]);
    }
}

void Update(int node, int left, int right, int pos, int value)
{
    if(left == right)
        aint[node] = value;
    else
    {
        int mid = (left + right) / 2;
        if(pos <= mid)
            Update(node * 2, left, mid, pos, value);
        else
            Update(node * 2 + 1, mid + 1, right, pos, value);

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

int Query(int node, int left, int right, int Q_left, int Q_right)
{
    if(left >= Q_left && right <= Q_right)
        return aint[node];

    int mid = (left + right) / 2;
    if(mid >= Q_right)
        return Query(node * 2, left, mid, Q_left, Q_right);
    else if(mid + 1 <= Q_left)
        return Query(node * 2 + 1, mid + 1, right, Q_left, Q_right);
    
    int val_left = Query(node * 2, left, mid, Q_left, Q_right);
    int val_right = Query(node * 2 + 1, mid + 1, right, Q_left, Q_right);
    return max(val_left, val_right);
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> a[i];

    Build(1, 1, n);
    while(m--)
    {
        int tip, x, y;
        cin >> tip >> x >> y;
        if(tip == 0)
            cout << Query(1, 1, n, x, y) << '\n';
        else
            Update(1, 1, n, x, y);
    }

    return 0;
}