Introduction - If you have any usage issues, please Google them yourself
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.