#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define tmax (int)4e5+1
#define leftSon (node<<1)
#define rightSon (node<<1)+1

int elements, queries, type, value, leftRange, rightRange, pos;

int tree[tmax];

void update(int node, int left, int right);
void query(int node, int left, int right);

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int i;
    scanf("%i %i", &elements, &queries);
    for(pos = 1; pos <= elements; pos++) 
    {
          scanf("%i", &value);
          update(1, 1, elements);
    }
    while(queries --)
    {
                  scanf("%i", &type);
                  if(type == 0)
                  {
                          scanf("%i %i", &leftRange, &rightRange);
                          value = 0;
                          query(1, 1, elements);
                          printf("%i\n", value);
                  }else
                  {
                       scanf("%i %i", &pos, &value);
                       update(1, 1, elements);
                  }
    }
    scanf("%i", &i);
    return 0;
}

void update(int node, int left, int right)
{
     if(left == right)       
     {
             tree[node] = value;  
             return ;            
     }
     int mid = (left + right) >> 1; 
     if(pos <= mid)  update(leftSon, left, mid); 
     else update(rightSon, mid + 1, right);      
     tree[node] = max(tree[leftSon], tree[rightSon]); 
}
                  
void query(int node, int left, int right)
{
     if(leftRange <= left && right <= rightRange)
     {
                  value = max(value, tree[node]);
                  return ;
     }
     int mid = (left + right)  >> 1;
     if(leftRange <= mid) query(leftSon, left, mid);
     if(mid < rightRange) query(rightSon, mid + 1, right);
}