//#define NDEBUG
#pragma warning(disable : 4146)

#include <bits/stdc++.h>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
using f64 = double;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f_) : f(std::forward<F>(f_)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';

i64 floor_div(const i64 n, const i64 d) {
  assert(d != 0);
  return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0);
}

i64 ceil_div(const i64 n, const i64 d) {
  assert(d != 0);
  return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0);
}

#ifdef N91_LOCAL
#define OJ_LOCAL(a, b) b
#else
#define OJ_LOCAL(a, b) a
#endif

} // namespace n91


#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

struct dsu {
  public:
    dsu() : _n(0) {}
    explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    std::vector<int> parent_or_size;
};

}  // namespace atcoder


namespace n91 {

bool solve() {
  const usize n = scan<usize>() + 2;
  const usize m = scan<usize>() + 2;
  const usize a = scan<usize>();
  const usize b = scan<usize>();
  const usize c = scan<usize>();
  const usize d = scan<usize>();
  std::vector<std::string> s(n, std::string(m, '.'));
  for (const usize i : rep(1, n - 1)) {
    std::cin >> s[i];
    s[i] = "." + s[i] + ".";
  }

  std::vector<usize> deg(n * m + 8);
  atcoder::dsu dsu(n * m + 8);

  const auto add = [&](const usize x, const usize y) {
    deg[x]++;
    deg[y]++;
    dsu.merge(x, y);
  };

  for (const usize i : rep(1, n)) {
    for (const usize j : rep(0, m)) {
      if (s[i][j] == '.' || s[i - 1][j] == '.')
        continue;
      usize x = i * m + j, y = (i - 1) * m + j;
      if (i == a && j == b)
        x = n * m;
      if (i - 1 == a && j == b)
        y = n * m + 1;
      if (i == c && j == d)
        x = n * m + 4;
      if (i - 1 == c && j == d)
        y = n * m + 5;
      add(x, y);
    }
  }
  for (const usize i : rep(0, n)) {
    for (const usize j : rep(1, m)) {
      if (s[i][j] == '.' || s[i][j - 1] == '.')
        continue;
      usize x = i * m + j, y = i * m + (j - 1);
      if (i == a && j == b)
        x = n * m + 2;
      if (i == a && j - 1 == b)
        y = n * m + 3;
      if (i == c && j == d)
        x = n * m + 6;
      if (i == c && j - 1 == d)
        y = n * m + 7;
      add(x, y);
    }
  }
  for (const usize i : rep(0, n)) {
    for (const usize j : rep(0, m)) {
      if (s[i][j] == 'R' && !(i == a && j == b)) {
        bool ok = false;
        for (const usize k : rep(0, 4))
          ok |= dsu.same(i * m + j, n * m + k);
        if (!ok)
          return false;
      }
      if (s[i][j] == 'B' && !(i == c && j == d)) {
        bool ok = false;
        for (const usize k : rep(4, 8))
          ok |= dsu.same(i * m + j, n * m + k);
        if (!ok)
          return false;
      }
    }
  }

  std::vector<int> is_path(n * m + 8, true);

  for (const usize i : rep(0, n)) {
    for (const usize j : rep(0, m)) {
      if (s[i][j] != '.' && deg[i * m + j] >= 3) {
        is_path[dsu.leader(i * m + j)] = false;
      }
    }
  }

  std::vector<int> is_bicol(n * m + 8, true);
  std::vector<usize> sw_count(n * m + 8, 0);

  for (const usize i : rep(1, n)) {
    for (const usize j : rep(0, m)) {
      if (s[i][j] == '.' || s[i - 1][j] == '.')
        continue;
      usize x = i * m + j, y = (i - 1) * m + j;
      if (i == a && j == b)
        x = n * m;
      if (i - 1 == a && j == b)
        y = n * m + 1;
      if (i == c && j == d)
        x = n * m + 4;
      if (i - 1 == c && j == d)
        x = n * m + 5;
      if (s[i][j] == s[i - 1][j])
        is_bicol[dsu.leader(x)] = false;
      else
        sw_count[dsu.leader(x)] += 1;
    }
  }
  for (const usize i : rep(0, n)) {
    for (const usize j : rep(1, m)) {
      if (s[i][j] == '.' || s[i][j - 1] == '.')
        continue;
      usize x = i * m + j, y = i * m + (j - 1);
      if (i == a && j == b)
        x = n * m + 2;
      if (i == a && j - 1 == b)
        y = n * m + 3;
      if (i == c && j == d)
        x = n * m + 6;
      if (i == c && j - 1 == d)
        x = n * m + 7;
      if (s[i][j] == s[i][j - 1])
        is_bicol[dsu.leader(x)] = false;
      else
        sw_count[dsu.leader(x)] += 1;
    }
  }

  for (const usize kr : rep(0, 4)) {
    for (const usize kb : rep(4, 8)) {
      if (!dsu.same(n * m + kr, n * m + kb))
        continue;
      if (dsu.size(n * m + kr) == 2)
        continue;
      const usize root = dsu.leader(n * m + kr);
      if (is_bicol[root]) {
        return false;
      }
      if (!is_path[root])
        continue;
      assert(sw_count[root] >= 1);
      if (sw_count[root] >= 2)
        return false;
    }
  }
  return true;
}

void main_() {
  const usize t = scan<usize>();
  for (const usize i : rep(0, t))
    std::cout << (solve() ? "YES" : "NO") << eoln;
}

} // namespace n91

int main() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  std::cout << std::fixed << std::setprecision(20);
  n91::main_();
  return 0;
}