Introduction - If you have any usage issues, please Google them yourself
Joseph problem is a well-known problem: N personal circle, starting the first reported number of M will be killed first, the last remaining one, the rest will be killed. For example, N = 6, M = 5, were killed in the following order: 5,4,6,2,3,1.