在一座山上有n个山洞（每个洞从0~n-1分别编号），这山上有一只兔子躲在山洞里，有一只狼，从编号为0的山洞开始入洞，每隔m个洞，再次入洞抓兔子，现在问，兔子能否避免这场灾难？-The queue data with n cave in a mountain (each hole from the 0~n-1 number), this mountain has a rabbit hid in the cave, there is a wolf, start putting 0 cave from the number, every m a hole, the hole again to catch a hare, now is the time to ask, can avoid this rabbit disaster?