#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;

int v[100005];
int aint[400005];

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

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

    int middle = (left + right) / 2;
    buildTree(2 * node, left, middle);
    buildTree(2 * node + 1, middle + 1, right);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void updateTree(int node, int left, int right, int a, int b) {
    if (left == right) {
        aint[node] = b;
        return;
    }
    int middle = (left + right) / 2;
    if (a <= middle)
        updateTree(2 * node, left, middle, a, b);
    else
        updateTree(2 * node + 1, middle + 1, right, a, b);
    
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

int query(int node, int left, int right, int a, int b) {
    if (a <= left && right <= b) {
        return aint[node];
    } else {
        int middle = (left + right) / 2;
        int leftAnswer = -1, rightAnswer = -1;
        if (a <= middle)
            leftAnswer = query(2 * node, left, middle, a, b);
        if (middle < b)
            rightAnswer = query(2 * node + 1, middle + 1, right, a, b);
        return max(leftAnswer, rightAnswer);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    buildTree(1, 1, n);

    for (int i = 1; i <= m; i++) {
        int op, a, b;
        fin >> op >> a >> b;
        if (op == 0) {
            fout << query(1, 1, n, a, b) << "\n";
        } else {
            updateTree(1, 1, n, a, b);
        }
    }
    
    return 0;
}