狼找兔子问题：一座山周围有n个洞，顺时针编号为0,1,2,3,4,…，n-1。一只狼从狼从零号洞开始，顺时针方向计数，每当经过第m个洞时，就进洞找兔子。例如n=5，m=3，狼经过的洞依次为0,3,1,4,2,0。输入m，n。兔子有没有幸免的机会？如果有该藏在哪？-The Wolf find rabbits problem: a mountain have　n　holes, clockwise Numbers for 0,1,2,3,4,... , n- 1.A Wolf from the　zero number hole start, clockwise count, when after the first m a hole, hole to find a rabbit. For example, n = 5, m = 3, the Wolf through hole in turn is 0,3,1,4,2,0. Input m, n. Rabbits have surviving opportunity? If there is the hidden?