#include <bits/stdc++.h>
#define pb push_back
#define mod 100003
#define INF 2e9
#define ull unsigned long long
using namespace std;
ifstream in ("arbint.in");
ofstream out ("arbint.out");
ull n, v[100001], tree[500004], k, t, x, y;
void update(int node, int left, int right, int pos, ull val){
    if(left == right) {
        tree[node] = val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
        update(2 * node, left, mid, pos, val);
    else
        update(2 * node + 1, mid + 1, right, pos, val);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}

ull query(int node, int left, int right, int x, int y){
    if(x <= left && right <= y)
        return tree[node];
    else{
        int mid = (left + right) / 2;
        ull a = 0, a1 = 0;
        if(x <= mid)
            a = query(2 * node, left, mid, x, y);
        if(y > mid)
            a1 = query(2 * node + 1, mid + 1, right, x, y);
        return max(a, a1);
    }
}

void build(int node, int left, int right){
    if(left == right){
        tree[node] = v[left];
        return;
    }

    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}

int main() {
    in >> n >> k;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    build(1,1, n);
    for(int i = 1; i <= k; i++){
        in >> t >> x >> y;
        if(t == 1)
            update(1, 1, n, 1ull * x, 1ull * y);

        else
            out << query(1, 1, n, x, y) << '\n';
    }
}