[问题描述] 约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。

[基本要求] 利用单向循环链表存储结构模拟此过程，按照出列的顺序印出各人的编号。

-[Problem Descr iption] Joseph, a descr iption of the problem is: numbered 1,2, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report the number of m stop reported. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction on the next person started to re-reported from a few, and so on, until all of the column until all the up. Try a program designed to find out the column order. [Basic requirements] the use of a one-way circular linked list storage structure simulation of this process, in accordance with the order of columns printed out each number.