1.　　约瑟夫（Joseph）问题的一种描述是：编号为1,2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。

2.　　演示程序以用户和计算机的对话方式进行，即在计算机终端上显示“提示信息”之后，由用户在键盘上输入演示程序中规定的运算命令；相应的输入数据（滤去输入中的非法值）和运算结果显示在其后。

3.　　程序不得采用公式计算等其他数学方式求解。

4.　　测试数据：

-1. A descr iption of Joseph (Joseph) the problem is: numbered 1,2, ..., n by n individuals sitting clockwise circle, each holding a password (positive integer). Optionally start a positive integer as the number of reported upper limit of m,　the first person to embark on the clockwise direction　a starting sequence number off, stop newspaper report the number of hours m. Reported m people out of the column, his password as a new m value, starting　his next person in a clockwise direction　one number off again, and so on, until everyone up all the columns. Try to design a program to determine the order of the columns.

2. demonstration program in dialogues users and computers, namely after displaying　message , input by the user demo predetermined arithmetic commands at the keyboard on the computer terminal　illicit corresponding input data (filtered inputs value) and the results are shown in the subsequent operation.

3. The program shall not be used other mathematically calculated and