约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个 正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人 开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a descr iption of the problem is: numbered 1,2, ..., n, n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose the beginning of a positive integer number as reported on the limit m, starting from the first person in a clockwise direction starting from a report number, report m, the number of stops reported. Reported m the person out of the column, his password as the new value of m, in a clockwise direction from the next person he began to re-reported from a number, it goes on, until all the people all of the columns so far. Design a program, according to the column order prints each number.