Problem Description
Once a day, XX has been caught by evil Z. WisKey, our team leader, has to rescue her. They have escaped from Z’s castle. But unfortunately, they lost in the forest. What’s more, this forest is a big maze. There is only one place to leave. Z is familiar with the forest, and he will arrive at the place in T minutes.
To make the problem simply, we assume the forest is a N*M two-dimensional array which left-top corner is (0,0) and right-bottom corner is (N-1,M-1). The place they stayed now is marked S , and the place to leave is marked E. They could only move to empty place in four directions (up, down , left, right ), or stay at the place.
. : empty
X: the tree
S: the place Wiskey and XX now stay
E: the place to leave
Your task is to give out whether they can escape.
Input
The input contains several test cases. Each test case starts with a line contains three number N ,M (2<= N <= 100, 2 <= M <= 100 ) indicate the size of the maze, T (2 <= T <= 20) indicate the time Z cost to arrive at E place. Then N lines follows, each line contains M character. A S and a E will be in the map.
Output
For each test case, you should print the number of different ways to arrive at the E place, if they can arrive at E place before T minutes. And you should print “Oh, my god, bad luck!”, if they arrive at E place at the same time with Z, because Z will catch them. Otherwise, “God will bless XX and WisKey!” should be printed.
Sample Input
5 6 4
XXXX..
XS.X..
XX.XXX
XX..EX
XXXXXX
5 6 5
XXXX..
XS.X..
XX..XX
XX..EX
XXXXXX
5 6 6
XXXX..
XS.X..
XX..XX
XX..EX
XXXXXX
Sample Output
God will bless XX and WisKey!
Oh, my god, bad luck!
2
