#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 1e5+10;

const int INF = -1e9;

int v[N];
int x[N*10];
int n, m;
int lef, rig;

int left(int i)
{
    return 2*i + 1;
}
int right(int i)
{
    return 2*i + 2;
}

int get(int node, int l, int r, int ll, int rr)
{
    if(l >= ll && r <= rr)
    {
        return x[node];
    }

    if(r < ll || l > rr)
    {
        return INF;
    }

    int mid = (l + r) / 2;
    return max(get(left(node), l, mid, ll, rr), get(right(node), mid+1, r, ll, rr));
}

int update(int node, int l, int r, int np, int nn)
{
    if(l == r && r == np)
    {
        x[node] = nn;
        return x[node];
    }
    if(r < np || l > np)
    {
        return x[node];
    }

    int mid = (l + r) / 2;
    int leftu = update(left(node), l, mid, np, nn);
    int rightu = update(right(node), mid+1, r, np, nn);
    x[node] = max(leftu, rightu);
    return x[node];
}

void build(int node, int l, int r)
{
    if(l == r)
    {
        x[node] = v[l];
        return;
    }

    int mid = (l + r) / 2;
    build(left(node), l, mid);
    build(right(node), mid+1, r);
    x[node] = max(x[left(node)], x[right(node)]);
}

int main()
{
    fin >> n >> m;
    for(int i = 0; i < n; ++i)
    {
        fin >> v[i];
    }

    build(0, 0, n-1);

    for(int i = 0; i < m; ++i)
    {
        bool typ;
        fin >> typ;
        fin >> lef >> rig;

        if(!typ)
        {
            fout << get(0, 0, n-1, lef-1, rig-1) << "\n";
        }
        else
        {
            update(0, 0, n-1, lef-1, rig);
        }
    }

    return 0;
}