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