#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


/*
  0: red
  1: blue
  A: fixed red
  B: fixed blue
  
  solve for each component after removing A,B
  assume both A,B touch
  
  Case. chain && A,B touching at both ends
    A........B
    A00011111B
  Case. otherwise
    take MST and then attach A,B as leaf
    \exists u, deg(u) >= 3
    outside u-A path, u-B path: easy
    
    A...u.....B
        0
    
    A...u10101B
        0
    
    A101010101B
        0
    
    same RLE && \exists 00 or 11: can transform
    OK <=> \exists 00 or 11 or 0A or 1B
*/

constexpr int DX[4] = {+1, 0, -1, 0};
constexpr int DY[4] = {0, +1, 0, -1};

int M, N;
int X[2], Y[2];
char S[510][510];

int id(int x, int y) {
  return x * N + y;
}

bool solve() {
  uf.assign(M*N, -1);
  for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (S[x][y] == '0' || S[x][y] == '1') {
    if (x + 1 < M && (S[x + 1][y] == '0' || S[x + 1][y] == '1')) connect(id(x, y), id(x + 1, y));
    if (y + 1 < N && (S[x][y + 1] == '0' || S[x][y + 1] == '1')) connect(id(x, y), id(x, y + 1));
  }
  vector<vector<int>> uss(M*N);
  for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (S[x][y] == '0' || S[x][y] == '1') {
    const int u = id(x, y);
    uss[root(u)].push_back(u);
  }
  for (int r = 0; r < M*N; ++r) if (uss[r].size()) {
// cerr<<uss[r]<<endl;
    bool has[2] = {};
    bool touch[2] = {};
    bool chain = true;
    int same = 0, diff = 0;
    for (const int u : uss[r]) {
      const int x = u / N, y = u % N;
      has[S[x][y] - '0'] = true;
      int deg = 0;
      for (int dir = 0; dir < 4; ++dir) {
        const int xx = x + DX[dir];
        const int yy = y + DY[dir];
        if (0 <= xx && xx < M && 0 <= yy && yy < N && S[xx][yy] != '.') {
          ++deg;
          if (S[xx][yy] == '0' || S[xx][yy] == '1') {
            ((S[x][y] == S[xx][yy]) ? same : diff) += 1;
          } else {
            touch[S[xx][yy] - 'A'] = true;
            ((S[x][y] - '0' == S[xx][yy] - 'A') ? same : diff) += 2;
          }
        }
      }
      chain = chain && (deg <= 2);
    }
    for (int c = 0; c < 2; ++c) {
      if (has[c] && !touch[c]) return false;
    }
    if (chain) {
      if (diff > 2) return false;
    } else {
      if (!same) return false;
    }
  }
  return true;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &M, &N);
    for (int c = 0; c < 2; ++c) {
      scanf("%d%d", &X[c], &Y[c]);
      --X[c];
      --Y[c];
    }
    for (int x = 0; x < M; ++x) {
      scanf("%s", S[x]);
    }
    
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
      if (S[x][y] == 'R') S[x][y] = '0';
      if (S[x][y] == 'B') S[x][y] = '1';
    }
    for (int c = 0; c < 2; ++c) S[X[c]][Y[c]] = "AB"[c];
// for(int x=0;x<M;++x){for(int y=0;y<N;++y)cerr<<((S[x][y]=='0'||S[x][y]=='A')?COLOR("91"):(S[x][y]=='1'||S[x][y]=='B')?COLOR("94"):COLOR())<<S[x][y]<<COLOR();cerr<<endl;}
    
    const bool ans = solve();
    puts(ans ? "YES" : "NO");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}