#include<stdio.h>

int max[300000],tip,a,b,i,m,n,x;

inline void refresh(int nod,int st,int dr,int pos,int val)
{
	if(st==pos&&pos==dr) max[nod]=val;
	else
	{
		int m=(st+dr)/2;
		if(pos<=m) refresh(2*nod,st,m,pos,val);
		else refresh(2*nod+1,m+1,dr,pos,val);
		
		if(max[2*nod]>max[2*nod+1]) max[nod]=max[2*nod];
		else max[nod]=max[2*nod+1];
	}
}

inline int maxint(int nod,int st,int dr,int aa,int bb)
{
	if(aa<=st&&dr<=bb) return max[nod];
	else
	{
		int m=(st+dr)/2;
		int xst=0,xdr=0;
		if(aa<=m) xst=maxint(2*nod,st,m,aa,bb);
		if(bb>m) xdr=maxint(2*nod+1,m+1,dr,aa,bb);
		if(xst>xdr) return xst;
		return xdr;
	}
}

int main()
{
	freopen("arbint.in","r",stdin);
	freopen("arbint.out","w",stdout);
	
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		refresh(1,1,n,i,x);
	}
	for(i=0;i<m;i++)
	{
		scanf("%d%d%d",&tip,&a,&b);
		switch(tip)
		{
			case 0:
				printf("%d\n",maxint(1,1,n,a,b));
				break;
		case 1:
				refresh(1,1,n,a,b);
				break;
		}
	}
	
	return 0;
}