#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 1e5 + 5;

int aint[NMax * 4];

void Update(int node, int lo, int hi, int pos, int val){
    if(lo == hi){
        aint[node] = val;
        return;
    }
    int mid = (lo + hi) >> 1;
    if(pos <= mid){
        Update(node * 2, lo, mid, pos, val);
    } else {
        Update(node * 2 + 1, mid + 1, hi, pos, val);
    }
    aint[node] = max(aint[node * 2], aint[node * 2 + 1]);
}

int Query(int node, int lo, int hi, int a, int b){
    if(a <= lo && b >= hi){
        return aint[node];
    }
    int mid = (lo + hi) >> 1;
    int A = 0;
    int B = 0;
    if(a <= mid){
        A = Query(node * 2, lo, mid, a, b);
    }
    if(b > mid){
        B = Query(node * 2 + 1, mid + 1, hi, a, b);
    }
    return max(A, B);
}

int main(){
    int n, m, x, t, a, b;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> x;
        Update(1, 1, n, i, x);
    }
    for(int i = 1; i <= m; i++){
        fin >> t >> a >> b;
        if(t == 1){
            Update(1, 1, n, a, b);
        } else {
            fout << Query(1, 1, n, a, b) << "\n";
        }
    }
    return 0;
}