以正整数n，i，k作为输入，其中n，i，k>0，且i<n。假定数1，2，…，n是环形排列的。试编写一个程序，从数i开始，按顺时针方向以k为步长打印数，当打印某个数时，应从环中删去该数，这样的过程一直进行到环空为止。例如，当n=10，i=1，k=3时，得到的输出序列是3，6，9，2，7，1，8，5，10，4。-In a positive integer n, i, k as an input, wherein n, i, k> 0, and i <n. Assuming that the number 1,2, ..., n is an annular array. Try to write a program, starting　number i, k clockwise direction increments the number of prints, when printing a number, this number should ring deleted, this process has been carried out to the ring empty. For example, when n = 10, i = 1, k = 3, the output sequence is obtained 3,6,9,2,7,1,8,5,10,4.