编号是1，2，„ „ ,n的n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值m,从第一个仍开始顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新从1报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。

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

-Number is 1,2,　 , n n individuals sitting clockwise circle in accordance with, each person has only one password (positive integer). Optionally start a positive integer as the number of reported upper limit of m, starting with the first in a clockwise direction　a start sequence still report the number of register-stop message to the number of hours m. Reported m people out of the column, his password as a new m value, starting　his next person in a clockwise direction　one number off again, and so on until everyone all the columns so far. Design a program to find out the column order.

One-way circular list storage structure to simulate this process, in accordance with the order of the columns in the output of each individual number.