#include <iostream>
#include <fstream>
using namespace std;
#define dim 100001
int v[dim];
int arbint[4 * dim + 66];

void Build(int nod, int left, int right) {
   if(left == right) {
      arbint[nod] = v[left];
   }
   else {
      int mid = (left + right) / 2;
      Build(2 * nod, left, mid);
      Build(2 * nod + 1, mid + 1, right);
      arbint[nod] = max(arbint[2 * nod], arbint[2 * nod + 1]);
   }
}

void Update(int nod, int left, int right, int pos, int val) {
   if(left == right) {
      arbint[nod] = val;
   }
   else {
      int mid = (left + right) / 2;
      if(pos >= left && pos <= mid)
         Update(2 * nod, left, mid, pos, val);
      if(pos > mid && pos <= right)
         Update(2 * nod + 1, mid + 1, right, pos, val);
      arbint[nod] = max(arbint[2 * nod], arbint[2 * nod + 1]);
   }
}

int Query(int nod, int left, int right, int st, int dr) {
   int ans = 0;
   if(left >= st && right <= dr && arbint[nod] > ans) {
      ans = arbint[nod];
   }
   else {
      int mid = (left + right)/2;
      if(st <= mid) {
         int x = Query(2 * nod, left, mid, st, dr);
         if(x > ans)
            ans = x;
      }
      if(mid < dr) {
         int x = Query(2 * nod + 1, mid + 1, right, st, dr);
         if(x > ans)
            ans = x;
      }
   }
   return ans;
}

int main()
{
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");

    int n, m, op, a, b;

    cin >> n >> m;

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

    Build(1, 1, n);

    for(int i = 1; i <= m; ++i) {
      cin >> op >> a >> b;
      if(op) {
         Update(1, 1, n, a, b);
      }
      else
         cout << Query(1, 1, n, a, b) << '\n';
    }
    return 0;
}