约瑟夫环（Joseph）问题的一种描述是：编号1，2，┉，n的n个人按顺时针方向围坐一圈，每个人持有一个密码（正整数），一开始，任选一个正整数作为报数上线值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1开始报数，如此下去，直至所有人全部出列为止。设计一个程序求出出列顺序。-Joseph Ring (Joseph) a descr iption of the problem is: No. 1,2, ┉, n of n individuals sitting around a circle clockwise, each person has a password (positive integer), the start and either a positive integer value, as reported on line number m, from the first individual to embark on the clockwise direction starting from an order of the number reported, report the number of m, to stop reporting. Who reported m dequeuing his password as the new m value, clockwise from him the next person on the re-start at 1 count off, it goes on, until the owner of all the columns up. Design a program calculated the column order.