#include <bits/stdc++.h>

using namespace std;

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

int aint[400005], a[100005], n, m;

void Build(int nod, int st, int dr){
    if(st == dr){
        aint[nod] = a[st];
        return;
    }
    int mid = (st + dr) / 2;
    Build(2 * nod, st, mid);
    Build(2 * nod + 1, mid + 1, dr);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

void Update(int nod, int st, int dr, int poz, int val){
    if(st == dr){
        aint[nod] = val;
        return;
    }

    int mid = (st + dr) / 2;
    if(poz <= mid)
        Update(2 * nod, st, mid, poz, val);
    else
        Update(2 * nod + 1, mid + 1, dr, poz, val);
    aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
}

int Query(int nod, int st, int dr, int l, int r){
    if(st == l && dr == r)
        return aint[nod];
    int mid = (st + dr)/2;
    if(r <= mid)
        return Query(2 * nod, st, mid, l, r);
    if(l > mid)
        return Query(2 * nod + 1, mid + 1, dr, l, r);
    return max(Query(2 * nod, st, mid, l, mid), Query(2 * nod + 1, mid + 1, dr, mid + 1, r));
}

int main()
{
    int x, y, task;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
    }
    Build(1, 1, n);
    for(int i = 1; i <= m; i++){
        fin >> task >> x >> y;
        if(task == 1)
            Update(1, 1, n, x, y);
        else
            fout << Query(1, 1, n, x, y) << "\n";
    }

    return 0;
}