Alice and Bob are playing a game on an $n\times m$ grid where each cell has either 'A', 'B' or '.' written on it. They take turns moving a chess piece on the grid and Alice moves first.

Initially the piece is on cell $(1,1)$. In each player's turn, he or she can move the piece one cell right or one cell down. That is, if the piece is on cell $(x,y)$ before the turn, the player can move it to $(x+1,y)$ or $(x,y+1)$, as long as it doesn't go beyond the grid.

At any time, if the piece is on a cell with 'A', Alice wins and the game ends. If the piece is on a cell with 'B', Bob wins and the game ends. If the piece reaches cell $(n,m)$ without the game ending, then it is a draw.

Since Alice cannot decide what acts Bob will take, she would like to know if she can be in control of the situation. Given the grid they're playing on, can you tell her if she can always find a way to win, draw or lose the game no matter what acts Bob takes?

In the first line an integer $T\space (1 \le T \le 50)$, representing the number of test cases.

For each test case, the first line contains two integers $N,M\space (1\le N,M \le 500)$, representing the grid's size.

Each of the next $N$ lines for the case contains $M$ characters (either 'A', 'B' or '.'), describing the grid.

For each test case, output three words 'yes' or 'no' in one line, representing if Alice can find a way to win, draw or lose the game respectively (without quotes).