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:
	import java.io.*;
	import java.util.*;
	import java.math.*;
	
	 
	 public class Main	{
	   static class Pair implements Comparable<Pair>{
	   int a;
	   int b;
	   public Pair(int x,int y){a=x;b=y;}
	   public Pair(){}
	   public int compareTo(Pair p){
		 return a - p.a;
	   }
	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + a;
		result = prime * result + b;
	//	out.println("hashcode = "+result);
		return result;
	}
	@Override
	public boolean equals(Object obj) {
		Pair cur = (Pair)obj;
		if((a==cur.a && b==cur.b) || (a==cur.b && b==cur.a))return true;
		return false;
	}
	 }
	   static class cell implements Comparable<cell>{
		   int a,b;
		   long dis;
		   public cell(int x,int y,long z) {a=x;b=y;dis=z;}
		   public int compareTo(cell c) {
			   return Long.compare(dis,c.dis);
		   }
	   }
	static class TrieNode{
		TrieNode left;
		TrieNode right;
		int op;
		int data;
		public TrieNode() {}
	}
	  public static long gcd(long a,long b)
	  {
	    if(a<b)
	
	      return gcd(b,a);
	    if(b==0)
	      return a;
	    return gcd(b,a%b);
	    
	  }
	  static long lcm(long a,long b) {
		  return  a*b / gcd(a,b);
	  }
	  //static long ans = 0;
	  static long mod = 998244353;//(long)(1e9+7);//
	   
	    public static void main(String[] args) throws Exception {
	       new Thread(null, null, "Anshum Gupta", 99999999) {
	            public void run() {
	                try {
	                    solve();
	                } catch(Exception e) {
	                    e.printStackTrace();
	                    System.exit(1);
	                }
	            }
	        }.start();
	    }
	
	static long pow(long x,long y){
	    if(y == 0)return 1;
	    if(y==1)return x;
	    long a = pow(x,y/2);
	    a = (a*a)%mod;
	    if(y%2==0){
	        return a;
	    }
	    return (a*x)%mod;
	}
	
	static long mxx;
	static int mxN = (int)(1e7);
	static long[]fact,inv_fact;
	static long my_inv(long a) {
		return pow(a,mod-2);
	}
	static long bin(int a,int b) {
		if(a < b || a<0 || b<0)return 0;
	    return ((fact[a]*inv_fact[a-b])%mod * inv_fact[b])%mod;
	}
	static ArrayList<ArrayList<Integer>>adj;
	static boolean[]vis;
	static void make_facts() {
	  fact=new long[mxN];
	  inv_fact = new long[mxN];
	  fact[0]=inv_fact[0]=1L;
	  for(int i=1;i<mxN;i++) {
		   fact[i] = (i*fact[i-1])%mod;
		   inv_fact[i] = my_inv(fact[i]);
	  }
	}
	//static int[]bfs(int a){
	//	Queue<Integer> q = new  LinkedList<Integer>();
	//	
	//	vis = new boolean[n+1];
	//	int[]dis = new int[n+1];
	//	q.add(a);
	//	dis[a] = 0;
	//	vis[a] = true;
	//	while(!q.isEmpty()) {
	//		int cur = q.poll();
	//	//	vis[cur] = true;
	//	//	if(cur == b)break;
	//		for(int x : adj.get(cur)) {
	//			if(vis[x])continue;
	//			q.add(x);
	//			dis[x] = dis[cur]+1;
	//			vis[x] = true;
	//		}
	//	}
	//	return dis;
	//}
	static long find(long x) {
		long y = 2;
		long val = 0;
		long cnt = 0;
			while(y <= x) {
				val += (++cnt)*(x/y);
				y *= 2;
			}
			return val;
	}
	 public static void solve() throws Exception {
	   // solve the problem here
	   MyScanner s = new MyScanner();
	        out = new PrintWriter(new BufferedOutputStream(System.out), true);
	        int tc = s.nextInt();
	        mxx = (long)(1e18+5);
	//        make_facts();  
	       
	        while(tc-->0){
	        	int n = s.nextInt();
	        	int m = s.nextInt();
	        	char[][]arr = new char[n][m];
	        	int g = 0, b = 0;
	        	for(int i=0;i<n;i++) {
	        		arr[i] = s.next().toCharArray();
	        		for(int j=0;j<m;j++) {
	        			if(arr[i][j] == 'G')g++;
	        			else if(arr[i][j] == 'B')b++;
	        		}
	        	}
	        	int[]x = {-1,1,0,0};
	        	int[]y = {0,0,-1,1};
	        	for(int i=0;i<n;i++) {
	        		for(int j=0;j<m;j++) {
	        			if(arr[i][j] == 'B') {
	        				for(int k=0;k<4;k++) {
	        					int x1 = i + x[k];
	        					int y1 = j + y[k];
	        					if(x1 < 0 || y1 < 0 || x1 >= n || y1 >= m )continue;
	        					if(arr[x1][y1] == '.') {
	        						arr[x1][y1] = '#';
	        					}
	        				}
	        			}
	        		}	
	        	}

	        	boolean[][]vis = new boolean[n][m];
	        	Queue<Pair> q = new LinkedList<Main.Pair>();
	        	if(arr[n-1][m-1] == '.') {
	        	vis[n-1][m-1] = true;
	        	q.add(new Pair(n-1,m-1));
	        	}
	        	while(!q.isEmpty()) {
	        		Pair cur = q.poll();
	        		for(int k=0;k<4;k++) {
	        			int x1 = cur.a + x[k];
    					int y1 = cur.b + y[k];
    					if(x1 < 0 || y1 < 0 || x1 >= n || y1 >= m || vis[x1][y1] || arr[x1][y1] == '#' )continue;
    					if(arr[x1][y1] == 'G')g--;
    					q.add(new Pair(x1,y1));
    					vis[x1][y1] = true;
	        		}
	        	}
	        	boolean ok = true;
	        	for(int i=0;i<n;i++) {
	        		for(int j=0;j<m;j++) {
	        			if(arr[i][j] == 'G' && !vis[i][j] ||
	        				arr[i][j] == 'B' && vis[i][j]) {
	        				ok = false;
	        				break;
	        			}
	        		}
	        	}
	        	
        		out.println(ok ? "yes" : "no");
	        	
	        }
	        	
	           
	        out.flush();
	}
	 
	     
	 
	 
	 
	    //-----------PrintWriter for faster output---------------------------------
	    public static PrintWriter out;
	 
	    //-----------MyScanner class for faster input----------
	    public static class MyScanner {
	        BufferedReader br;
	        StringTokenizer st;
	 
	        public MyScanner() {
	            br = new BufferedReader(new InputStreamReader(System.in));
	        }
	 
	        String next() {
	            while (st == null || !st.hasMoreElements()) {
	                try {
	                    st = new StringTokenizer(br.readLine());
	                } catch (IOException e) {
	                    e.printStackTrace();
	                }
	            }
	            return st.nextToken();
	        }
	 
	        int nextInt() { return Integer.parseInt(next()); }
	        long nextLong() { return Long.parseLong(next()); }
	        double nextDouble() { return Double.parseDouble(next()); }
	         
	        String nextLine(){
	            String str = "";
	            try {
	                str = br.readLine();
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	            return str;
	        }
	    }
	    //--------------------------------------------------------
	}