#include<fstream>
#include<algorithm>
using namespace std;

int n, m;
unsigned int a[100009];
void Solve();
unsigned int Maxim1(int i, int j)
{
	unsigned int maxim=a[i];
	if(j > n)
	j=n;
	for(int k=i; k <= j; ++k)
		if(maxim < a[k])
			maxim = a[k];
		
	return maxim;
}
	

int main()
{
	Solve();
	return 0;
}

void Solve()
{
	ifstream fin("arbint.in");
	ofstream fout("arbint.out");
	
	fin >> n >> m;
	for(int i = 1; i <= n; i++)
		fin >> a[i];
	
	int x, y, z;
	for(int i = 1; i <= m; ++i)
	{
		fin >> x >> y >> z;
		if(x == 0)
			fout <<Maxim1(y, z) << '\n';
		if(x == 1)
			a[y] = z;
	}
	fin.close();
	fout.close();
}