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