#include <bits/stdc++.h>
struct MI {
 private:
  char bb[1 << 14];
  FILE* f;
  char *bs, *be;
  char e;
  bool o, l;

 public:
  MI() : f(stdin), bs(0), be(0) {}
  MI(FILE* f) : f(f), bs(0), be(0) {}
  inline operator bool() { return !l; }
  inline char get() {
    if (o) {
      o = 0;
      return e;
    }
    if (bs == be) be = (bs = bb) + fread(bb, 1, sizeof(bb), f);
    if (bs == be) {
      l = 1;
      return -1;
    };
    return *bs++;
  }
  inline void unget(char c) {
    o = 1;
    e = c;
  }
  template <class T>
  inline T read() {
    T r;
    *this > r;
    return r;
  }
  template <class T>
  inline MI& operator>(T&);
};
template <class T>
struct Q {
  const static bool U = T(-1) >= T(0);
  inline void operator()(MI& t, T& r) const {
    r = 0;
    char c;
    bool y = 0;
    if (U)
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (isdigit(c)) break;
      }
    else
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (c == '-') {
          c = t.get();
          if (isdigit(c)) {
            y = 1;
            break;
          };
        } else if (isdigit(c))
          break;
        ;
      };
    for (;;) {
      if (c == -1) goto E;
      if (isdigit(c))
        r = r * 10 + (c ^ 48);
      else
        break;
      c = t.get();
    }
    t.unget(c);
  E:;
    if (y) r = -r;
  }
};
template <>
struct Q<char> {
  inline void operator()(MI& t, char& r) {
    int c;
    for (;;) {
      c = t.get();
      if (c == -1) {
        r = -1;
        return;
      };
      if (!isspace(c)) {
        r = c;
        return;
      };
    }
  }
};
template <class T>
inline MI& MI::operator>(T& t) {
  Q<T>()(*this, t);
  return *this;
}
template <class T>
std::ostream& operator<(std::ostream& out, const T& t) {
  return out << t;
}
using std::cout;
MI cin;
const int $n = 25;
const int $p = $n * $n;
const int $e = 770;
int tp;
bool has[$e];
void extend_init();
bool can_add_A(int x);
bool can_add_B(int x);
void pre_A(int old);
bool ok_for_A(int now);
void pre_B(int now);
bool ok_for_B(int old);
void on_extend();
inline void matroid_intersection() {
  static int q[$e], fr[$e];
  static bool fin[$e];
  int hd, tl;
  auto push = [&](int x, int y) -> bool {
    fr[y] = x;
    q[++tl] = y;
    if (fin[y]) {
      for (int c = y; ~c; c = fr[c]) has[c] ^= 1;
      return 1;
    }
    return 0;
  };
  auto extend = [&]() -> bool {
    extend_init();
    hd = 1;
    tl = 0;
    for (int __r = (tp), i = (1); i <= __r; ++i) {
      fr[i] = fin[i] = 0;
      if (has[i]) continue;
      const auto A = can_add_A(i), B = can_add_B(i);
      if (A && B) return has[i] = 1;
      if (A)
        fr[q[++tl] = i] = -1;
      else
        fin[i] = B;
    }
    while (hd <= tl) {
      const auto x = q[hd++];
      if (has[x]) {
        pre_A(x);
        for (int __r = (tp), y = (1); y <= __r; ++y)
          if (!has[y] && !fr[y] && ok_for_A(y) && push(x, y)) return 1;
      } else {
        pre_B(x);
        for (int __r = (tp), y = (1); y <= __r; ++y)
          if (has[y] && !fr[y] && ok_for_B(y) && push(x, y)) return 1;
      }
    }
    return 0;
  };
  while (extend()) on_extend();
}
struct point {
  int x, y;
} pos[$e];
int n, m, dn, dm, es[$e][2], black[$e], id[$n][$n], deg[$p], f[$p], ps, add;
bool bl[$n][$n];
char out[$n * 2][$n * 2];
int getf(int x) { return f[x] == x ? x : (f[x] = getf(f[x])); }
inline void build() {
  for (int __r = (ps), i = (1); i <= __r; ++i) f[i] = i;
  for (int __r = (tp), i = (1); i <= __r; ++i)
    if (has[i]) f[getf(es[i][0])] = getf(es[i][1]);
}
void extend_init() {
  build();
  for (int __r = (ps), i = (1); i <= __r; ++i) deg[i] = 0;
  for (int __r = (tp), i = (1); i <= __r; ++i)
    if (has[i]) ++deg[es[i][0]], ++deg[es[i][1]];
}
bool can_add_A(int x) { return getf(es[x][0]) != getf(es[x][1]); }
bool can_add_B(int x) { return black[x] == 1 || deg[black[x]] != 2; }
void pre_A(int old) {
  has[old] = 0;
  build();
  has[old] = 1;
}
bool ok_for_A(int now) { return getf(es[now][0]) != getf(es[now][1]); }
void pre_B(int now) { add = black[now]; }
bool ok_for_B(int old) {
  return black[old] == add || add == 1 || deg[add] != 2;
}
void on_extend() {}
inline void work() {
  cin > n > m;
  dn = n * 2 - 1;
  dm = m * 2 - 1;
  for (int __r = (dn), i = (1); i <= __r; ++i)
    for (int __r = (dm), j = (1); j <= __r; ++j) out[i][j] = ' ';
  ps = 0;
  for (int __r = (n), i = (1); i <= __r; ++i) {
    cin.unget(cin.read<char>());
    for (int __r = (m), j = (1); j <= __r; ++j) {
      bl[i][j] = (out[i * 2 - 1][j * 2 - 1] = cin.get()) == 'X';
      if (!bl[i][j])
        id[i][j] = ++ps;
      else
        id[i][j] = 0;
    }
  }
  tp = 0;
  for (int __r = (n), i = (1); i <= __r; ++i)
    for (int __r = ((m)-1), j = ((i == 1) + 1); j <= __r; ++j)
      if (id[i][j] && id[i][j + 1])
        pos[++tp] = {i * 2 - 1, j * 2}, es[tp][0] = id[i][j],
        es[tp][1] = id[i][j + 1], black[tp] = es[tp][(i ^ j) & 1], has[tp] = 0;
  for (int __r = (m), j = (1); j <= __r; ++j)
    for (int __r = ((n)-1), i = ((j == 1) + 1); i <= __r; ++i)
      if (id[i][j] && id[i + 1][j])
        pos[++tp] = {i * 2, j * 2 - 1}, es[tp][0] = id[i][j],
        es[tp][1] = id[i + 1][j], black[tp] = es[tp][(i ^ j) & 1], has[tp] = 0;
  matroid_intersection();
  for (int __r = (ps), i = (1); i <= __r; ++i) deg[i] = 0;
  for (int __r = (tp), i = (1); i <= __r; ++i)
    if (has[i]) ++deg[black[i]];
  for (int __r = (n), i = (1); i <= __r; ++i)
    for (int __r = (m), j = (1); j <= __r; ++j)
      if (id[i][j] && (i != 1 || j != 1) && !((i ^ j) & 1) &&
          deg[id[i][j]] != 2)
        return (void)(cout < "NO\n");
  if (id[1][2])
    pos[++tp] = {1, 2}, es[tp][0] = 1, es[tp][1] = id[1][2], has[tp] = 0;
  if (id[2][1])
    pos[++tp] = {2, 1}, es[tp][0] = 1, es[tp][1] = id[2][1], has[tp] = 0;
  build();
  for (int __r = (tp), i = (1); i <= __r; ++i)
    if (getf(es[i][0]) != getf(es[i][1]))
      has[i] = 1, f[getf(es[i][0])] = f[getf(es[i][1])];
  for (int __r = (tp), i = (1); i <= __r; ++i)
    if (has[i]) out[pos[i].x][pos[i].y] = 'O';
  cout < "YES\n";
  for (int __r = (dn), i = (1); i <= __r; ++i) {
    for (int __r = (dm), j = (1); j <= __r; ++j) cout < out[i][j];
    cout < ('\n');
  }
}
int main() {
  for (int __r = ((cin.read<int>())), _ = (1); _ <= __r; ++_) work();
}
