编号为1，2……，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。(t's numbered 1, 2... N's n individual sits in a clockwise circle, each holding a password (positive integer). One began to choose a positive integer as the number of the upper limit of M, starting from the first person in a clockwise direction from 1 to the beginning of the order number, back off m stop. Who reported m out of line, his password as the new m value, from the next person in a clockwise direction began to count off from 1, and so on, until all the columns so far.)