You are given a chess board of order 8x8 with exactly 2 bishops placed on it. Print "Yes" if they can attack each other during the first move of one of the bishops; "No" otherwise.

Input

The first line consists of an integer t (1 <= t <= 1000), the number of test cases. For each test case, you will be given the description of the board with 8 strings (8 characters in each string). 'B' denotes a cell with a bishop and '.' denotes an empty cell. There is an empty line after every test case.

Output

For each test case print "Yes" or "No" (case sensitive).

Example

Input:
2
.......B
........
........
....B...
........
........
........
........

........
........
........
.B...B..
........
........
........
........

Output:
Yes
No