3087：Aqua Splash

Recently a game named Aqua Splash attracted ZWC especially. The way to play the game is simple:
Give you a n*n chessboard. At first there are some blisters(水泡) on some position of the chessboard. There are three kinds of blisters. They will contain 1, 2 or 3 globules(水珠).

Now ZWC can choose one grid which has a blister to click. When being clicked, the blister will add one globule. If the number of globules in one blister is not less than 4, the blister will burst and disappear. Meanwhile, it will splash into 4 globules to up, down, left, right direction. In each direction, the first blister that not burst will absorb the globule and its globules will add one. This action may cause new blisters’ burst. If all the blisters have burst, ZWC will win the game.

To simplify this problem, you may suppose the globules move very fast and every second divide into two parts, at first all blisters have not less than 4 globules will burst and splash globules. Then the blisters still not burst try to absorb these globules. The following second repeats the same action.
You can get more detailed information from the sample.
ZWC wants to know whether he could win the game by clicking only one of the blisters. Can you help him?

The first line of the input is a single integer T which means the number of test cases.
Each test case starts with a line contains three numbers n (0 < n <= 20), the size of chessboard, x, y (1 <= x, y <= n) the grid that ZWC has clicked. Then n lines follow, each contains n integers. The integer a_ij (0<=a_ij <4) indicates the ith row and jth column of the chessboard has a blister with a_ij globules, a_ij = 0 means there isn’t exist a blister.

For each case, print the case number followed by the answer of your program. If he can finish the game, please output: “Yes! Good job ZWC!” Or output: “No! Please try again ZWC!”. Just use the format as shown in the sample output.