# 2604. Five in a Row

The ACM Team of WHU is planning an online AI arena for Go-bang (Five in a Row). Now, we need some help.

We all know the famous game “Five in a Row”. It is traditionally played with go pieces (black and white stones) on a go

board (15x15 intersections). The winner is the first player to get an unbroken row of five stones horizontally, vertically, or

diagonally.

We now have an uncompleted game, that is to say, yet no one won. You are required to tell us that whether the next player

could win within one step or not.

### 输入格式

The input consists of multiple test cases. The first line of input contains an integer T, which is the number of test cases.

Each test case is a 15 * 15 go board, ‘B’ represent for a black stone while ‘W’ for white ones. ‘.’ represents cross with no

stone represented by 0.

[Technical Specification]

T is an integer, and T <= 20.

The number of white stones is either equal or 1 less than the number of black stones.

There is at least ONE ‘.’ in each test case.

Test cases are separated by ONE empty line.

You can assume that black player goes first.

### 输出格式

For each test case, print a single line containing the result. If the next player could win within one step, display ‘YES’,

otherwise, display ‘NO’.

### 样例

Input
2
........W......
..W......W...B.
.W....B........
.W.......W.....
..BB....W......
...B...........
....B........WW
...........B...
....W..........
.W..B.B....WBB.
BW........B.W.B
...............
W.....BB.W....W
B..B.W.BB....B.
........WW.....
...B...W..BBW..
W..WBW..W...B..
...W..WBW......
.....BWW..B.B..
..BW.B.B..W....
B..W..WBW......
B......B......W
B.B...B....W...
....B.WB...B...
B.W............
.....WW...B....
..B.....B...W.W
.W.........WBW.
B..............
..W.B...W..W..B

Output
NO
YES


5 人解决，12 人已尝试。

5 份提交通过，共有 39 份提交。

8.3 EMB 奖励。