#include <bits/stdc++.h>
using namespace std;
#define debug_var(x) cout << #x << '=' << x << endl;
#define debug_stl(x) for(auto k : x) cout << k << ' '; cout << endl;
#define debug_map(x) for(auto k : x) cout << k.first << ':' << k.second << endl;
#define read_vector(x, s, k) for(auto i = s; i <= k; ++i) cin >> x[i];
#define read_2dvector(x, s, l1, l2) for(auto i = s; i <= l1; ++i) for(auto j = s; j <= l2; ++j) cin >> x[i][j];
#define vec vector
#define ull unsigned long long int
#define ll long long int
#define str string
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define umset unordered_multiset
#define NMax 100000

int v[NMax + 1], arb[NMax * 4 + 1], n, m;

inline int left_son(int node) { return node * 2; }
inline int right_son(int node) { return node * 2 + 1; }

void init_arb(int node, int left, int right) {
  if(left == right) {
    arb[node] = v[left];
    return;
  }
  int middle = (left + right) / 2;
  init_arb(left_son(node), left, middle);
  init_arb(right_son(node), middle + 1, right);
  arb[node] = max(arb[left_son(node)], arb[right_son(node)]);
}
void update(int node, int left, int right, int pos, int value) {
  if(pos == left && pos == right) {
    arb[node] = value;
    return;
  }
  int middle = (left + right) / 2;
  if(pos <= middle) update(left_son(node), left, middle, pos, value);
  else update(right_son(node), middle + 1, right, pos, value);
  arb[node] = max(arb[left_son(node)], arb[right_son(node)]);
}
int query(int node, int left, int right, int query_left, int query_right) {
  if(query_left <= left && right <= query_right) return arb[node];
  int middle = (left + right) / 2;
  int q_left = INT_MIN, q_right = INT_MIN, result;
  if(query_left <= middle)
    q_left = query(left_son(node), left, middle, query_left, query_right);
  if(query_right > middle)
    q_right = query(right_son(node), middle + 1, right, query_left, query_right);
  return max(q_left, q_right);
}

int main() {
  freopen("arbint.in", "r", stdin);
  freopen("arbint.out", "w", stdout);
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  cin >> n >> m;
  read_vector(v, 1, n);
  init_arb(1, 1, n);
  for(int i = 1; i <= m; ++i) {
    int type, x, y;
    cin >> type >> x >> y;
    if(type == 0) cout << query(1, 1, n, x, y) << '\n';
    else update(1, 1, n, x, y); // Output: 5 3 4
  }
  return 0;
}