Problem: Vivek has encountered a problem. He has a maze that can be represented as an n × m grid. Each of the grid cells may represent the following:

  * Empty — '.' 
  * Wall — '#' 
  * Good person — 'G' 
  * Bad person — 'B' 



The only escape from the maze is at cell (n, m).

A person can move to a cell only if it shares a side with their current cell and does not contain a wall. Vivek wants to block some of the empty cells by replacing them with walls in such a way, that all the good people are able to escape, while none of the bad people are able to. A cell that initially contains 'G' or 'B' cannot be blocked and can be travelled through.

Help him determine if there exists a way to replace some (zero or more) empty cells with walls to satisfy the above conditions.

It is guaranteed that the cell (n,m) is empty. Vivek can also block this cell.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n, m (1 ≤ n, m ≤ 50) — the number of rows and columns in the maze.

Each of the next n lines contain m characters. They describe the layout of the maze. If a character on a line equals '.', the corresponding cell is empty. If it equals '#', the cell has a wall. 'G' corresponds to a good person and 'B' corresponds to a bad person.

Output

For each test case, print "Yes" if there exists a way to replace some empty cells with walls to satisfy the given conditions. Otherwise print "No"

You may print every letter in any case (upper or lower).

Example

Input


6
1 1
.
1 2
G.
2 2
#B
G.
2 3
G.#
B#.
3 3
#B.
#..
GG.
2 2
#B
B.


Output


Yes
Yes
No
No
Yes
Yes

Note

For the first and second test cases, all conditions are already satisfied.

For the third test case, there is only one empty cell (2,2), and if it is replaced with a wall then the good person at (1,2) will not be able to escape.

For the fourth test case, the good person at (1,1) cannot escape.

For the fifth test case, Vivek can block the cells (2,3) and (2,2).

For the last test case, Vivek can block the destination cell (2, 2).

Solution (in JAVA):

Solution:
//package CodeforcesJava;

import java.io.*;
import java.util.*;

public class Main {

    public void solve(InputProvider in, PrintWriter out) throws IOException {
        int testCount = in.nextInt();
        for (int test = 0; test < testCount; test++) {
            int rowCount = in.nextInt();
            int columnCount = in.nextInt();
            int[][] map = new int[rowCount][columnCount];
            Set<Position> badPositions = new HashSet<>();
            Set<Position> goodPositions = new HashSet<>();
            for (int row = 0; row < map.length; row++) {
                String rowDescription = in.nextLine();
                for (int column = 0; column < map[row].length; column++) {
                    map[row][column] = rowDescription.charAt(column);
                    if (map[row][column] == 'B') {
                        badPositions.add(new Position(row, column));
                    }
                    if (map[row][column] == 'G') {
                        goodPositions.add(new Position(row, column));
                    }
                }
            }
            map[map.length - 1][map[0].length - 1] = 'D';
            boolean can;
            if (goodPositions.isEmpty()) {
                can = true;
            } else {
                boolean badBlocked = true;
                for (Iterator<Position> iterator = badPositions.iterator(); iterator.hasNext() && badBlocked; ) {
                    Position badPosition = iterator.next();
                    badBlocked = tryBlock(map, badPosition);
                }
                if (!badBlocked) {
                    can = false;
                } else {
                    findWay(map);
                    can = true;
                    for (Iterator<Position> iterator = goodPositions.iterator(); iterator.hasNext() && can; ) {
                        Position goodPosition = iterator.next();
                        can = map[goodPosition.row][goodPosition.column] == 'D';
                    }
                }
            }
            out.print(can ? "Yes\n" : "No\n");
        }
    }

    private static class Position {

        private final int row;
        private final int column;

        private Position(int row, int column) {
            this.row = row;
            this.column = column;
        }

        @Override
        public int hashCode() {
            return Objects.hash(row, column);
        }

        @Override
        public boolean equals(Object obj) {
            return (obj instanceof Position) && (((Position) obj).row == row) && (((Position) obj).column == column);
        }

    }

    private static boolean tryBlock(int[][] map, Position position) {
        boolean canBlock = true;
        for (int row = Math.max(0, position.row - 1);
             row <= Math.min(position.row + 1, map.length - 1) && canBlock; row++) {
            canBlock = map[row][position.column] != 'G' && map[row][position.column] != 'D';
            map[row][position.column] = '#';
        }
        for (int column = Math.max(0, position.column - 1);
             column <= Math.min(position.column + 1, map[position.row].length - 1) && canBlock; column++) {
            canBlock = map[position.row][column] != 'G' && map[position.row][column] != 'D';
            map[position.row][column] = '#';
        }
        return canBlock;
    }

    private static void findWay(int[][] map) {
        findWay(map, map.length - 1, map[0].length - 1);
    }
    
    private static void findWay(int[][] map, int row, int column) {
        map[row][column] = 'D';
        if (row - 1 >= 0 && map[row - 1][column] != '#' && map[row - 1][column] != 'D') {
            findWay(map, row - 1, column);
        }
        if (row + 1 < map.length && map[row + 1][column] != '#' && map[row + 1][column] != 'D') {
            findWay(map, row + 1, column);
        }
        if (column - 1 >= 0 && map[row][column - 1] != '#' && map[row][column - 1] != 'D') {
            findWay(map, row, column - 1);
        }
        if (column + 1 < map[0].length && map[row][column + 1] != '#' && map[row][column + 1] != 'D') {
            findWay(map, row, column + 1);
        }
    }

    public static void main(String[] args) throws Exception {
        try (InputProvider input = new InputProvider(System.in);
             PrintWriter output = new PrintWriter(System.out)) {
            new Main().solve(input, output);
        }
    }

    public static class InputProvider implements AutoCloseable {

        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputProvider(Reader reader) {
            this.reader = new BufferedReader(reader);
        }

        public InputProvider(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input));
        }

        public String next() throws IOException {
            if (Objects.isNull(tokenizer) || !tokenizer.hasMoreTokens())
                tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public String nextLine() throws IOException {
            return reader.readLine();
        }

        @Override
        public void close() throws Exception {
            reader.close();
        }

    }

}