如果有多于一种次序的棕、绿和无色废品箱都满足同一个最少的移动次数，则按照字母表的顺序输入第一个字符串最小的一种。

If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed.

youdao

你的程序应该按输入的顺序从1开始对图标进行编号，并按照输入的顺序从“A”开始以字母表对区域进行编号。

Your program must number all icons (even invisible ones) in the order of arrival starting from 1 and label regions alphabetically in the order of arrival starting from 'A'.

youdao