//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <iostream>
#include <array>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<vector<ll> > vvll;
typedef vector<vector<pll> > vvpll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
const ll MOD = 1e9 + 7;
double eps = 1e-6;
#define forn(i,e) for(ll i = 1; i <= e; i++)
#define for0n(i,e) for(ll i = 0; i < (e); i++)
#define forsn(i,s,e) for(ll i = s; i <= e; i++)
#define rforn(i,s) for(ll i = s; i >= 1; i--)
#define rfor0n(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define llinf 2e18
#define iinf 1e9
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

//VARIABLES

int v[100005];
int arb[400005];

//FUNCTIONS

void update(int nod, int st, int dr, int pos, int val) {
    if (st == dr) {
        arb[nod] = val;
        return;
    }

    int mid = (st + dr) / 2;

    if (pos <= mid) update(2 * nod, st, mid, pos, val);
    else update(2 * nod + 1, mid + 1, dr, pos, val);

    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

int query(int nod, int st, int dr, int ST, int DR) {
    

    if (ST <= st && dr <= DR) {
        return arb[nod];
    }

    int mid = (st + dr) / 2;
    int ans = 0;
    if (ST <= mid) {
        ans = max(ans, query(2 * nod, st, mid, ST, DR));
    }
    if (mid < DR) {
        ans = max(ans, query(2 * nod + 1, mid + 1, dr, ST, DR));
    }

    return ans;
}

//MAIN
int main() {

#ifdef INFOARENA
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
#endif

    int n, m; cin >> n >> m;

    for (int i = 1; i <= n; i++) {
        cin >> v[i];
        update(1, 1, n, i, v[i]);
    }

    //for (int i = 1; i <= 13; i++) cout << arb[i];

    while (m--) {
        int c, a, b;
        cin >> c >> a >> b;
       if (c == 0) cout << query(1, 1, n, a, b) << '\n';
       else update(1, 1, n, a, b);
    }

    return 0;
}