约瑟夫环问题：设编号为1，2，3，……，n的n(n>0)个人按顺时针方向围坐一圈，每个人持有一个正整数密码。开始时任选一个正整数做为报数上限m，从第一个人开始顺时针方向自1起顺序报数，报到m是停止报数，报m的人出列，将他的密码作为新的m值，从他的下一个人开始重新从1报数。如此下去，直到所有人全部出列为止。令n最大值取30。要求设计一个程序模拟此过程，求出出列编号序列-Josephus problem: Let numbered 1, 2, 3, ...... n n (n>　0) individuals sitting around a circle in a clockwise direction, each person holds a positive integer password. Optional when the start of a positive integer as reported the maximum number of m clockwise direction from the first person, self-a starting sequence reported number, report m stop the reported number of reported m the column, as a new password the value of m, start again from 1 number off from his next personal. It goes on, until all the columns until all. Let n be the maximum take 30. Asked to design a program to simulate the process, find the column number sequence