输入小孩总数n，从第k个小孩开始，循环的步长m。输出：最先输出的是第一个胜利者，其次为第二个，最后为第N个胜利者。-Enter the total number of children n, from the first k-child start the cycle of steps m. Output: The first output is the first winner, followed by the second, and finally for the first N winner.