问题描述:编号为1，2，……，n的n个人顺时针方向围坐一圈，每人持有一个密码（正整数）

一开始任选一个整数作为报数上限值m，从第一个人开始顺时针自1开始顺序报数，报到m时停止报数。

报m的人出列，将他的密码座位新的m值，从他在顺时针方向上的下一个人开始重新从1报数

如此下去，知道所有的人都出列为止。

例如：m的初值为20，n=7，7个人的密码依次是：3，1，7，2，4，8，4

出列的顺序为 6，1，4，7，2，3，5-Problem Descr iption: numbered 1,2, ... ..., n n-clockwise around a circle of individuals, each holder of a password (positive integer) the beginning of either an integer number as the upper limit at m, from the first clockwise from 1 person to start off the beginning of the order, appearance, stopped at a few m. Those who reported m out of his seat a new password m value, in a clockwise direction from the next person to start off again from the 1 like that, know that all out of date. For example: m for the initial 20, n = 7,7 personal password are: 3,1,7,2,4,8,4 out the order for the 6,1,4,7,2,3, 5