编程求Josephus问题：m个小孩围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩就离开，最后剩下的一个小孩是胜利者。求第几个小孩是胜利者。(Programming for Josephus problem: m children are surrounded by a circle. From the first child starts clockwise, every child counts to n child. The last child is the winner. A number of children is the winner)