狼找兔子问题：一座山周围有 n 个山洞，顺时针编号为 0,1,2,3,4,…，n-1。一只狼从狼从零号洞开始，顺时针方向计数，每当经过第 m 个洞时，就进洞找兔子。例如 n=5，m=3，狼经过的洞依次为 0,3,1,4,2,0。输入 m，n。兔子有没有幸免的机会？如果有该藏在哪？-Wolf looking rabbit problem: a mountain cave surrounded by n clockwise numbered 0,1,2,3,4, ..., n-1. A wolf　the wolf　Zero hole starts counting clockwise each time through the m-th hole, find the rabbit hole. For example, n = 5, m = 3, the wolf through holes were 0,3,1,4,2,0. Input m, n. Rabbits have spared no opportunity? If there is the hiding where?