求解约瑟夫问题：猴子选大王：设有n个猴子围坐一圈，编号为1到n ，从1号开始报数，数到m的猴子出列；下一个猴子又从1开始报数，数到m 的猴子又出列，依次类推，直到最后一个便是大王。要求输出出列顺序，分别以n=30,m=7；n=7，m=30运行程序，检查结果是否正确。-Solving the issue of Joseph: King of the monkeys selected: with a monkey n around a circle, numbered 1 to n, from the 1st to start off, a few of the m out of the monkeys　monkeys from the next 1 to start off, a few m of the monkey to another out, and so on, until the last one is the king. Requirements of the output out of order, respectively, n = 30, m = 7　n = 7, m = 30 run the program, test results are correct.