Everybody knows video game called "Snake". Martynas is developing an upgraded version of the original – "Snake++".
This is the game mechanics:
An example of snake's, whose starting length is 4, movement is showed in the following image (black squares are obstacles, gray squares are snake, black dot is food). In the fourth step snake have came out of the pit (you can see 4 segments of snake).

Martynas has generated some fields. The problem is that some fields are too small — snake cannot leave the pit without hitting the wall or itself. Your job is to find if the field is too small or not.
The first line contains the number of test cases T (T ≤ 50). In the first line of every test case there are integers n, m and k (3 ≤ n, m ≤ 10, 2 ≤ k ≤ 5) – the height of the field, the width of the field and the starting length of the snake. In every following n lines there are m symbols: 'x' for starting pit, '#' for obstacle, little letter 'o' for food and dot '.' for unoccupied square.
For each test case output one line containing “Case #tc: fit”, where tc is the number of the test case (starting from 1) and fit is text "Fits perfectly!" (without quotes) if snake can leave the pit and "Oh no, snake's too fat!" otherwise.
2
3 5 5
#####
.x#..
###.#
3 5 5
#####
.x#o.
###.#
Case #1: Fits perfectly!
Case #2: Oh no, snake's too fat!
| Name |
|---|


