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