说明：  假设有人数为n个人的一个小组，他们按顺时针方向围坐一圈。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报数m的人出列，然后从他原来所在的顺时针方向的下一个人开始重新从1报数，报到m时停止报数并出列。如此下去，直至所有人全部出列为止。要求按他们出列的顺序输出他们原来的代号。
(Suppose you have the number for a group of n people, who in a clockwise direction around a circle. Optionally start a positive integer as the number of reported upper limit of m, the first person to embark on the clockwise direction a starting sequence number off, stop newspaper report the number of hours m. M reported that the number of people out of the column, and then again number 1 newspaper, reported that the number of stop and when to report m the next person out of the line where his original starting clockwise. It goes on, until everyone up all the columns. Required by the order of the columns in their output to their original code.)