具体功能为：

编号为1，2，......，n的n个人按照顺时针方向围坐一圈，每个人有且只有一个密码（正整数）。一开始任选一个正整数作为报数上限值，从第一个人开始顺时针方向自1开始报数，报到m时停止报数。报m 的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新报数，如此下去，直到所有人全部出列为止；

如输入整型数据：1 2 3 4 5 6，输出为2 4 3 1 5 6-You are now use the list is the basis of Joseph ring, and the specific function for:

Numbers for 1, 2,...... , n n personal according to a circle round clockwise, everyone has one and only a password (positive integer). A began to choose a positive integer number off as the upper, from the first person clockwise direction since 1 began to sound off, report when m stop count off. The man stood for m, the password as new m value, clockwise from him in the next man began to sound off again, and so on, until all the people stood all so far

If the input integer data: 1 2 3 4 5 6, 4 3 1 output for 2 5 6