//#include <bits/stdc++.h>
#include <fstream>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <math.h>
#include <iomanip>
#include <stack>
#include <string.h>
#include <set>
 
using namespace std;
 
ifstream in("arbint.in");
ofstream out("arbint.out");

const int INF = 0x3f3f3f3f;
const int DIM = 4e5 + 7;

int v[DIM];
int mx;

void update(int nod, int l, int r, int pos, int val)
{
	if(l == r)
	{
		v[nod] = val;
		return ;
	}
	
	int mid = (l + r) / 2;
	
	if(pos <= mid)
		update(nod * 2, l, mid, pos, val);
	else
		update(nod * 2 + 1, mid + 1, r, pos, val);
	
	v[nod] = max(v[nod * 2], v[nod * 2 + 1]);
}

void query(int nod, int l, int r, int x, int y)
{
	if(x <= l && r <= y)
	{
		mx = max(mx, v[nod]);
		return ;
	}
	
	int mid = (l + r) / 2;
	
	if(x <= mid)
		query(nod * 2, l, mid, x, y);
	
	if(y > mid)
		query(nod * 2 + 1, mid + 1, r, x, y);
}

int main()
{
	int n, m;
	in >> n >> m;
	
	for(int i = 1; i <= n; i++)
	{
		int x;
		in >> x;
		
		update(1, 1, n, i, x);
	}
	
	while(m--)
	{
		int op;
		in >> op;
		
		int x, y;
		in >> x >> y;
		
		if(op == 0)
		{
			mx = -INF;
			
			query(1, 1, n, x, y);
			
			out << mx << '\n';
		}
		else
		{
			update(1, 1, n, x, y);
		}
	}
}