Any similarity of this problem to the game Chess is completely coincidental.
Cheesy Chess is a simple two-person game. It is played on an 8 × 8
board. Each player has one piece. The players take turns in moving
their respective pieces. The first player, say White, has a king. In one move, it can move one
position in any of the eight directions, horizontally, vertically or
diagonally, as long as it stays on the board. The second player, say
Black, has a pawn. In one move, it can move exactly one position
downwards. In fact, the pieces have to make such moves. They may not
stay at their positions. The White king is said to capture the Black pawn, if it moves onto
the position currently occupied by the pawn. The aim of the White king
is to do exactly this. The aim of the Black pawn is to reach the
bottom line of the board safely. As we will see later, however, there
are also other ways for White and Black to win. The game is complicated by the presence of forbidden fields and
dangerous fields. A forbidden field is a position on the board where
neither the White king, nor the Black pawn may come. A dangerous field
is a position where the Black pawn may come, but where the White king
may not move onto. In addition to the fixed dangerous fields, which are dangerous for
the entire game, there are (at most) two other, floating dangerous
fields, which depend on the position of the Black pawn. They are
adjacent to the pawn’s position: the position to the bottom left and
bottom right of the pawn, for as far as these positions exist within
the boundaries of the board and are not forbidden. All other positions
are called open fields, even if they are occupied by either of the pieces. For example, we may have the following situation, where forbidden
fields, dangerous fields and open fields are denoted by
<tt>'F'</tt>, <tt>'D'</tt> and
<tt>'.'</tt>, respectively, the White king is denoted by
<tt>'K'</tt> and the Black pawn is denoted by <tt>'P'</tt>. This illustration does not reveal whether the positions occupied by
the White king and the Black pawn are dangerous or open, and whether
the dangerous fields adjacent to the position of the pawn are fixed
dangerous fields or not. Due to a move of the Black pawn, the White king’s position may become
dangerous. This is not a problem: in the next move, the White king has
to move to another, open field anyway. The White king blocks the Black
pawn, if Black is to move, but the position below the pawn is occupied
by the White king. In this case, the pawn cannot move. The game ends, when You have to find out which player will win, given that White is the
first player to move and given that White plays optimally. The first line of the input file contains a single number: the number
of test cases to follow. Each test case has the following format: A description of the board, consisting of 8 lines, corresponding
to the 8 lines of the board, from top to bottom. Each line
contains a string of 8 characters from <tt>{'F', 'D',
'.'}</tt>. Here, <tt>'F'</tt> denotes a
forbidden field, <tt>'D'</tt> denotes a fixed
dangerous field and <tt>'.'</tt> (a period) denotes an
open field. Of course, an open field may become dangerous due to the position
of the Black pawn. One line with two integers xK
and yK
(1 ≤ xK
, yK
≤ 8), separated by a single space, specifying the initial
position of the White king. Here, xK
denotes the column (counted from the left) and yK
denotes the row (counted from below). This initial position is neither a forbidden field, nor a fixed
dangerous field. One line with two integers xP
and yP
(1 ≤ x
P
, yP
≤ 8), separated by a single space, specifying the initial
position of the Black pawn. Here, xP
denotes the column (counted from the left) and yP
denotes the row (counted from below). This initial position is not a forbidden field, and is different
from the initial position of the White king. For every test case in the input file, the output should contain a
single line containing the string
<tt>"White"</tt> (if White wins) or
<tt>"Black"</tt> (if Black wins).
输入描述
输出描述
输入例子
2
........
.......D
........
.....F..
..DDD...
..DFDD..
..DDD...
........
7 6
3 7
........
........
........
........
........
........
........
........
3 1
6 3
输出例子
Black
White