#include <bits/stdc++.h>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");


int n, m, answer;
int a[100005];
int aint[400020];

int Leftson(int x)
{
    return 2 * x;
}

int Rightson(int x)
{
    return 2 * x + 1;
}

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

void Update(int node, int left, int right, int pos, int val)
{
    if(left == right)
    {
        aint[node] = val;
        a[pos] = val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
        Update(Leftson(node), left, mid, pos, val);
    else
        Update(Rightson(node), mid + 1, right, pos, val);
    aint[node] = max(aint[Leftson(node)], aint[Rightson(node)]);
}

void Query(int node, int left, int right, int lquery, int rquery)
{
    if(lquery <= left && rquery >= right)
    {
        answer = max(answer, aint[node]);
        return;
    }
    int mid = (left + right) / 2;
    if(lquery <= mid)
        Query(Leftson(node), left, mid, lquery, rquery);
    if(rquery >= mid + 1)
        Query(Rightson(node), mid + 1, right, lquery, rquery);
}
void Citire()
{
    int i;
    fin >> n >> m;
    for(i = 1;i <= n;i++)
        fin >> a[i];
    Build(1, 1, n);
    while(m--)
    {
        int op, a, b;
        fin >> op >> a >> b;
        if(op == 1)
            Update(1, 1, n, a, b);
        else
        {
            answer = -2000000000;
            Query(1, 1, n, a, b);
            fout << answer << "\n";
        }
    }
}
int main()
{
    Citire();
    return 0;
}