#include <bits/stdc++.h>
using namespace std;

const int NMAX = 1e5;
int v[NMAX + 1];
int aint[NMAX + 1];

void build(int node, int st, int dr) {
    if(st == dr) {
        aint[node] = v[st]; //v[dr]
    } else {
        int mid = (st + dr) / 2;
        build(2 * node, st, mid);
        build(2 * node + 1, mid + 1, dr);

        aint[node] = max(aint[2 * node], aint[2 * node + 1]);
    }
}

//operatia 1
void update(int node, int st, int dr, int pos, int val) {
    if(st == dr) {
        aint[node] = val;
    } else {
        int mid = (st + dr) / 2;
        //[st, mid] sau [mid + 1, dr]
        if(pos <= mid) {
            update(2 * node, st, mid, pos, val);
        } else {
            update(2 * node + 1, mid + 1, dr, pos, val);
        }

        aint[node] = max(aint[2 * node], aint[2 * node + 1]);
    }
}

int query(int node, int st, int dr, int x, int y) {
    if(x <= st && dr <= y) {
        return aint[node];
    } else {
        int mid = (st + dr) / 2;
        //[st, mid], [mid + 1, dr]
        //[x, y]
        int L = 0, R = 0;
        if(x <= mid) {
            L = query(2 * node, st, mid, x, y);
        }
        if(mid + 1 <= y) {
            R = query(2 * node + 1, mid + 1, dr, x, y);
        }
        return max(L, R);
    }
}


int main() {
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");
    int n, q;
    cin >> n >> q;
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    build(1, 1, n);
    for(int i = 1; i <= q; i++) {
        int op, x, y;
        cin >> op >> x >> y;
        if(op == 1) {
            update(1, 1, n, x, y);
        } else {
            cout << query(1, 1, n, x, y) << '\n';
        }
        
    }

    //O(1)/O(N) => O(log N)/O(log N)
}