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

【基本要求】

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

-Joseph (Joseph) a descr iption of the problem: the number 1,2, ..., n n people sit in a circle in a clockwise direction, the person holding a password (a positive integer). Beginning optionally a positive integer as the upper limit of m in the reported number, starting from the first person since the start sequence reported clockwise direction, report m stop the reported number. Reported m the man out of the line, his password as the new value of m, start from the next person in the clockwise direction from a reported number, and so on, until everyone is all out of the line so far. Try to design a program that determined the order of columns. Requirements】 way circular linked list storage structure to simulate this process, in accordance with the order of the columns to print the number of each.