#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=503;
int n,m,sx,sy,tx,ty,d[N][2];
char ch[N][N];
bool vis1[N][N],vis2[N][N];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
bool Ok(int x,int y){return 1<=x&&x<=n&&1<=y&&y<=m&&ch[x][y]!='.';}
void Dfs1(int x,int y)
{
	if(vis1[x][y])return;
	vis1[x][y]=1;
	for(int i:{0,1,2,3})
	{
		int kx=x+dx[i],ky=y+dy[i];
		if(Ok(kx,ky)&&(kx!=tx||ky!=ty))Dfs1(kx,ky);
	}
}
void Dfs2(int x,int y)
{	
	if(vis2[x][y])return;
	vis2[x][y]=1;
	for(int i:{0,1,2,3})
	{
		int kx=x+dx[i],ky=y+dy[i];
		if(Ok(kx,ky)&&(kx!=sx||ky!=sy))Dfs2(kx,ky);
	}
}
bool NB(int x,int y)
{
	for(int o:{0,1,2,3})
	{
		int kx=x+dx[o],ky=y+dy[o];
		if(Ok(x,y)&&ch[x][y]==ch[kx][ky])return 0;
	}
	return 1;
}
void NO(){cout<<"NO"<<endl;}
void YES(){cout<<"YES"<<endl;}
void Solve()
{
	cin>>n>>m>>sx>>sy>>tx>>ty;
	for(int i=1;i<=max(n,m)+1;i++)d[i][0]=d[i][1]=0;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>ch[i][j];
	for(int i=1;i<=max(n,m)+1;i++)for(int j=1;j<=max(n,m)+1;j++)vis1[i][j]=vis2[i][j]=0;
	if(ch[sx][sy]!='R'||ch[tx][ty]!='B')return NO();
	if(m==1)
	{
		for(int i=1;i<=n;i++)ch[1][i]=ch[i][1];
		swap(n,m);
	}
	Dfs1(sx,sy);Dfs2(tx,ty);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)
	{
		if(ch[i][j]=='R'&&!vis1[i][j])return NO();
		if(ch[i][j]=='B'&&!vis2[i][j])return NO();
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(Ok(i,j))
	{
		for(int o:{0,1,2,3})
		{
			int x=i+dx[o],y=i+dy[o];
			if(!Ok(x,y)&&ch[i][j]!=ch[x][y])continue;
			if(NB(i,j)&&NB(x,y))return NO();
		}
	}
	return YES();
}
int main()
{
	int T;cin>>T;
	while(T--)Solve();
	return 0;
}