全WA

using namespace std;
map<int,int>d;
int n,m;
int a[1001];
int ans;
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	int f,x,y;
	while(m-->0)
	{
		scanf("%d%d%d",&f,&x,&y);
		if(f==0)
		{
			d.clear();
			ans=a[x];
			for(int i=x;i<=y;i++)
			{
				d[a[i]]+=1;
				if(d[a[i]]>d[ans]||(d[a[i]==d[ans]]&&ans>a[i]))
				{
					ans=a[i];
				}
			}
			printf("%d\n",ans);
		}
		else
		{
			a[x]=y;
		}
	}
	return 0;
}