约瑟夫（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph (Joseph) a descr iption of the problem is: No. 1, 2, ..., n-n individuals sitting around a circle in a clockwise direction, the person holding a code (positive integer). Start Choose a positive integer m, reported that the number of upper limit from the first person clockwise from 1 order report number, report m stop the reported number. Reported m the person out of the line, his password as the new values ​ ​ of m, starting from the next person in the clockwise direction from a number off again, and so on, until all all columns so far. Try to design a program to calculate the column order.