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