编号为1，2，…，n的n个人按顺时针方向围成一圈，每个人携带一个密码c（正整数）。开始任选一个正整数为报数上限值m，从第一个人开始顺时针自1依次报数，当报数为m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去,直至所有人出列为止,请输出出列的序列。-Numbered 1,2, ..., n of n individuals clockwise circle, each person carrying a code c (positive integers). Choose a positive integer starting number for the reported upper limit of m, starting clockwise from the first one to turn out numbers from 1, when the reported number of reported m the number of stops. Who reported m out of line, his password as the new m value in the clockwise direction from his next start back from a reported personal number, it goes on, until all the columns until a column in your output sequence.