[Problem Description] a bunch of monkeys have numbered in the 1,2,3 ... m, these monkeys (m a) in accordance with 1- m order around a circle, began to count 1, each number through N, the monkey will leave this circle, this turn, the circle until only last a monkey, the monkey is king. [Basic requirements] Input data: Input m, n. m, n are integers, n <m； 输出形式：中文提示按照m个猴子，数n个数的方法，输出为大王的猴子是几号，建立一个函数来实现此功能。

Monkey king election.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．