#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
template <typename T>
void ckmin(T &a, const T &b) {
  a = min(a, b);
}
template <typename T>
void ckmax(T &a, const T &b) {
  a = max(a, b);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
namespace __input {
template <class T1, class T2>
void re(pair<T1, T2> &p);
template <class T>
void re(vector<T> &a);
template <class T, size_t SZ>
void re(array<T, SZ> &a);
template <class T>
void re(T &x) {
  cin >> x;
}
void re(double &x) {
  string t;
  re(t);
  x = stod(t);
}
template <class Arg, class... Args>
void re(Arg &first, Args &...rest) {
  re(first);
  re(rest...);
}
template <class T1, class T2>
void re(pair<T1, T2> &p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T> &a) {
  for (auto &x : a) re(x);
}
template <class T, size_t SZ>
void re(array<T, SZ> &a) {
  for (auto &x : a) re(x);
}
}  // namespace __input
using namespace __input;
namespace __output {
template <typename T>
struct is_outputtable {
  template <typename C>
  static constexpr decltype(declval<ostream &>() << declval<const C &>(),
                            bool())
  test(int) {
    return true;
  }
  template <typename C>
  static constexpr bool test(...) {
    return false;
  }
  static constexpr bool value = test<T>(int());
};
template <
    class T, typename V = decltype(declval<const T &>().begin()),
    typename S = typename enable_if<!is_outputtable<T>::value, bool>::type>
void pr(const T &x);
template <class T,
          typename V = decltype(declval<ostream &>() << declval<const T &>())>
void pr(const T &x) {
  cout << x;
}
template <class T1, class T2>
void pr(const pair<T1, T2> &x);
template <class Arg, class... Args>
void pr(const Arg &first, const Args &...rest) {
  pr(first);
  pr(rest...);
}
template <class T, bool pretty = true>
void prContain(const T &x) {
  if (pretty) pr("{");
  bool fst = 1;
  for (const auto &a : x) pr(!fst ? pretty ? ", " : " " : "", a), fst = 0;
  if (pretty) pr("}");
}
template <class T>
void pc(const T &x) {
  prContain<T, false>(x);
  pr("\n");
}
template <class T1, class T2>
void pr(const pair<T1, T2> &x) {
  pr("{", x.first, ", ", x.second, "}");
}
template <class T, typename V, typename S>
void pr(const T &x) {
  prContain(x);
}
void ps() { pr("\n"); }
template <class Arg>
void ps(const Arg &first) {
  pr(first);
  ps();
}
template <class Arg, class... Args>
void ps(const Arg &first, const Args &...rest) {
  pr(first, " ");
  ps(rest...);
}
}  // namespace __output
using namespace __output;
namespace __algorithm {
template <typename T>
void dedup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), v.end());
}
template <typename T>
typename vector<T>::const_iterator find(const vector<T> &v, const T &x) {
  auto it = lower_bound((v).begin(), (v).end(), x);
  return it != v.end() && *it == x ? it : v.end();
}
template <typename T>
size_t index(const vector<T> &v, const T &x) {
  auto it = find(v, x);
  assert(it != v.end() && *it == x);
  return it - v.begin();
}
template <typename I>
struct _reversed_struct {
  I &v_;
  explicit _reversed_struct(I &v) : v_{v} {}
  typename I::reverse_iterator begin() const { return v_.rbegin(); }
  typename I::reverse_iterator end() const { return v_.rend(); }
};
template <typename I>
_reversed_struct<I> reversed(I &v) {
  return _reversed_struct<I>(v);
}
template <typename I>
struct _range_struct {
  const I first_, last_;
  explicit _range_struct(const I first, const I last)
      : first_{first}, last_{last} {}
  I begin() const { return first_; }
  I end() const { return last_; }
};
template <typename I>
_range_struct<I> range(const I first, const I last) {
  return _range_struct<I>(first, last);
}
}  // namespace __algorithm
using namespace __algorithm;
namespace __io {
void setIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << setprecision(15);
}
}  // namespace __io
using namespace __io;
struct union_find_bipartite {
  struct node {
    int parent, rank, size, status;
    bool parent_edge_parity;
    bool is_bipartite;
    int ct_nodes_on_root_side;
    node() {}
    node(int id)
        : parent(id),
          rank(0),
          size(1),
          status(-1),
          parent_edge_parity(0),
          is_bipartite(true),
          ct_nodes_on_root_side(1) {}
    int count_bipartitions() const {
      return !is_bipartite ? 0 : status == -1 ? 2 : 1;
    }
    int min_nodes_on_side_1() const {
      switch (status) {
        case 1:
          return ct_nodes_on_root_side;
        case 0:
          return size - ct_nodes_on_root_side;
        case -1:
          return std::min(ct_nodes_on_root_side, size - ct_nodes_on_root_side);
        default:
          assert(false);
      }
    }
  };
  int ct_components, ct_bipartite_components, degrees_of_freedom,
      min_nodes_on_side_1;
  mutable std::vector<node> data;
  union_find_bipartite(int N = 0)
      : ct_components(N),
        ct_bipartite_components(N),
        degrees_of_freedom(N),
        min_nodes_on_side_1(0),
        data(N) {
    iota(data.begin(), data.end(), 0);
  }

 private:
  void subtract_component(int u) {
    ct_components--;
    if (data[u].is_bipartite) {
      ct_bipartite_components--;
      degrees_of_freedom -= data[u].status == -1;
      min_nodes_on_side_1 -= data[u].min_nodes_on_side_1();
    }
  }
  void add_component(int u) {
    ct_components++;
    if (data[u].is_bipartite) {
      ct_bipartite_components++;
      degrees_of_freedom += data[u].status == -1;
      min_nodes_on_side_1 += data[u].min_nodes_on_side_1();
    }
  }

 public:
  int find(int u) const {
    if (u == data[u].parent) return u;
    find(data[u].parent);
    data[u].parent_edge_parity ^= data[data[u].parent].parent_edge_parity;
    return data[u].parent = data[data[u].parent].parent;
  }
  bool can_constrain_node_to_side(int u, bool side) const {
    find(u);
    side ^= data[u].parent_edge_parity;
    u = data[u].parent;
    return data[u].is_bipartite &&
           (data[u].status == -1 || data[u].status == side);
  }
  bool constrain_node_to_side(int u, bool side) {
    find(u);
    side ^= data[u].parent_edge_parity;
    u = data[u].parent;
    subtract_component(u);
    if (data[u].status == -1) {
      data[u].status = side;
    } else {
      data[u].is_bipartite &= data[u].status == side;
    }
    add_component(u);
    return data[u].is_bipartite;
  }
  bool can_add_constraint_on_nodes(int u, int v, bool edge_parity) const {
    find(u);
    edge_parity ^= data[u].parent_edge_parity;
    u = data[u].parent;
    find(v);
    edge_parity ^= data[v].parent_edge_parity;
    v = data[v].parent;
    return data[u].is_bipartite && data[v].is_bipartite &&
           (data[u].status == -1 || data[v].status == -1 ||
            (data[u].status ^ data[v].status) == edge_parity);
  }
  struct result {
    bool added_connectivity;
    bool component_is_bipartite;
  };
  result unite(int u, int v, bool edge_parity) {
    find(u);
    edge_parity ^= data[u].parent_edge_parity;
    u = data[u].parent;
    find(v);
    edge_parity ^= data[v].parent_edge_parity;
    v = data[v].parent;
    if (u == v) {
      subtract_component(u);
      if (edge_parity) data[u].is_bipartite = false;
      add_component(u);
      return {false, data[u].is_bipartite};
    }
    if (data[u].rank < data[v].rank) std::swap(u, v);
    subtract_component(u);
    subtract_component(v);
    data[v].parent = u;
    data[v].parent_edge_parity = edge_parity;
    if (data[u].rank == data[v].rank) data[u].rank++;
    data[u].size += data[v].size;
    data[u].is_bipartite &= data[v].is_bipartite;
    if (edge_parity)
      data[u].ct_nodes_on_root_side +=
          data[v].size - data[v].ct_nodes_on_root_side;
    else
      data[u].ct_nodes_on_root_side += data[v].ct_nodes_on_root_side;
    if (data[v].status != -1) {
      bool implied_u_status = data[v].status ^ edge_parity;
      if (data[u].status == -1)
        data[u].status = implied_u_status;
      else
        data[u].is_bipartite &= data[u].status == implied_u_status;
    }
    add_component(u);
    return {true, data[u].is_bipartite};
  }
  bool can_constrain_to_be_same(int u, int v) const {
    return can_add_constraint_on_nodes(u, v, 0);
  }
  bool can_constrain_to_be_different(int u, int v) const {
    return can_add_constraint_on_nodes(u, v, 1);
  }
  result constrain_to_be_same(int u, int v) { return unite(u, v, 0); }
  result constrain_to_be_different(int u, int v) { return unite(u, v, 1); }
};
const string NO = "NO", YES = "YES";
int main() {
  setIO();
  int n, m;
  re(n, m);
  const int S = n * m;
  auto ind = [&](int i, int j) { return i * m + j; };
  auto row = [&](int i) { return i / m; };
  auto col = [&](int i) { return i % m; };
  vb marked(S);
  for (int i = 0; i < n; i++) {
    string line;
    re(line);
    for (int j = 0; j < m; j++) marked[ind(i, j)] = line[j] == 'X';
  }
  auto get_adj = [&](int i) {
    vi res;
    for (int j : {i + 1, i - 1, i + m, i - m}) {
      if (marked[j]) continue;
      res.push_back(j);
    }
    return res;
  };
  vi special;
  union_find_bipartite uf(S);
  for (int i = 0; i < S; i++) {
    if (!marked[i]) continue;
    auto adj = get_adj(i);
    if (int((adj).size()) == 0) continue;
    if (int((adj).size()) == 1 || int((adj).size()) == 3) {
      ps(NO);
      return 0;
    }
    if (int((adj).size()) == 4) {
      for (int u : adj) {
        for (int v : adj) {
          if (u == v) continue;
          uf.unite(u, v, !(row(u) == row(v) || col(u) == col(v)));
        }
      }
      continue;
    }
    uf.unite(adj.front(), adj.back(), 1);
  }
  if (uf.ct_bipartite_components != uf.ct_components) {
    ps(NO);
    return 0;
  }
  ps(YES);
  for (int i = 0; i < S; i++) {
    if (marked[i]) continue;
    if (uf.can_constrain_node_to_side(i, 0)) uf.constrain_node_to_side(i, 0);
  }
  vvi ans(n, vi(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int u = ind(i, j);
      if (marked[u]) continue;
      ans[i][j] = uf.can_constrain_node_to_side(u, 0) ? 1 : 4;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int u = ind(i, j);
      if (!marked[u]) continue;
      for (int v : get_adj(u)) ans[i][j] += ans[row(v)][col(v)];
      assert(ans[i][j] % 5 == 0);
    }
  }
  for (auto &i : ans) pc(i);
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

Alice has an empty grid with n rows and m columns. Some of the cells are marked, and no marked cells are adjacent to the edge of the grid. (Two squares are adjacent if they share a side.) 

Alice wants to fill each cell with a number such that the following statements are true: 

  * every unmarked cell contains either the number 1 or 4; 
  * every marked cell contains the sum of the numbers in all unmarked cells adjacent to it (if a marked cell is not adjacent to any unmarked cell, this sum is 0); 
  * every marked cell contains a multiple of 5. 

Alice couldn't figure it out, so she asks Bob to help her. Help Bob find any such grid, or state that no such grid exists.

Input

The first line of input contains two integers n and m (1 ≤ n, m ≤ 500) — the number of rows and the number of columns in the grid, respectively.

Then n lines follow, each containing m characters. Each of these characters is either '.' or 'X' — an unmarked and a marked cell, respectively. No marked cells are adjacent to the edge of the grid.

Output

Output "'NO" if no suitable grid exists. Otherwise, output "'YES"'. Then output n lines of m space-separated integers — the integers in the grid.

Examples

Input


5 5
.....
.XXX.
.X.X.
.XXX.
.....


Output


YES
4 1 4 4 1
4 5 5 5 1
4 5 1 5 4
1 5 5 5 4
1 4 4 1 4


Input


5 5
.....
.XXX.
.XXX.
.XXX.
.....


Output


NO


Input


3 2
..
..
..


Output


YES
4 1
4 1
1 4


Input


9 9
.........
.XXXXX.X.
.X...X...
.X.XXXXX.
.X.X.X.X.
.X.XXX.X.
.X.....X.
.XXXXXXX.
.........


Output


YES
4 4 4 1 4 1 4 1 4
1 5 5 5 5 5 4 10 1
4 5 1 4 1 5 4 4 4
4 5 1 5 5 0 5 5 1
4 5 1 5 4 5 1 5 4
4 5 1 5 5 5 4 5 1
1 5 4 4 1 1 4 5 1
4 5 5 5 5 5 5 5 4
1 1 1 1 4 4 1 1 4

Note

It can be shown that no such grid exists for the second test.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
template <typename T>
void ckmin(T &a, const T &b) {
  a = min(a, b);
}
template <typename T>
void ckmax(T &a, const T &b) {
  a = max(a, b);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
namespace __input {
template <class T1, class T2>
void re(pair<T1, T2> &p);
template <class T>
void re(vector<T> &a);
template <class T, size_t SZ>
void re(array<T, SZ> &a);
template <class T>
void re(T &x) {
  cin >> x;
}
void re(double &x) {
  string t;
  re(t);
  x = stod(t);
}
template <class Arg, class... Args>
void re(Arg &first, Args &...rest) {
  re(first);
  re(rest...);
}
template <class T1, class T2>
void re(pair<T1, T2> &p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T> &a) {
  for (auto &x : a) re(x);
}
template <class T, size_t SZ>
void re(array<T, SZ> &a) {
  for (auto &x : a) re(x);
}
}  // namespace __input
using namespace __input;
namespace __output {
template <typename T>
struct is_outputtable {
  template <typename C>
  static constexpr decltype(declval<ostream &>() << declval<const C &>(),
                            bool())
  test(int) {
    return true;
  }
  template <typename C>
  static constexpr bool test(...) {
    return false;
  }
  static constexpr bool value = test<T>(int());
};
template <
    class T, typename V = decltype(declval<const T &>().begin()),
    typename S = typename enable_if<!is_outputtable<T>::value, bool>::type>
void pr(const T &x);
template <class T,
          typename V = decltype(declval<ostream &>() << declval<const T &>())>
void pr(const T &x) {
  cout << x;
}
template <class T1, class T2>
void pr(const pair<T1, T2> &x);
template <class Arg, class... Args>
void pr(const Arg &first, const Args &...rest) {
  pr(first);
  pr(rest...);
}
template <class T, bool pretty = true>
void prContain(const T &x) {
  if (pretty) pr("{");
  bool fst = 1;
  for (const auto &a : x) pr(!fst ? pretty ? ", " : " " : "", a), fst = 0;
  if (pretty) pr("}");
}
template <class T>
void pc(const T &x) {
  prContain<T, false>(x);
  pr("\n");
}
template <class T1, class T2>
void pr(const pair<T1, T2> &x) {
  pr("{", x.first, ", ", x.second, "}");
}
template <class T, typename V, typename S>
void pr(const T &x) {
  prContain(x);
}
void ps() { pr("\n"); }
template <class Arg>
void ps(const Arg &first) {
  pr(first);
  ps();
}
template <class Arg, class... Args>
void ps(const Arg &first, const Args &...rest) {
  pr(first, " ");
  ps(rest...);
}
}  // namespace __output
using namespace __output;
namespace __algorithm {
template <typename T>
void dedup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), v.end());
}
template <typename T>
typename vector<T>::const_iterator find(const vector<T> &v, const T &x) {
  auto it = lower_bound((v).begin(), (v).end(), x);
  return it != v.end() && *it == x ? it : v.end();
}
template <typename T>
size_t index(const vector<T> &v, const T &x) {
  auto it = find(v, x);
  assert(it != v.end() && *it == x);
  return it - v.begin();
}
template <typename I>
struct _reversed_struct {
  I &v_;
  explicit _reversed_struct(I &v) : v_{v} {}
  typename I::reverse_iterator begin() const { return v_.rbegin(); }
  typename I::reverse_iterator end() const { return v_.rend(); }
};
template <typename I>
_reversed_struct<I> reversed(I &v) {
  return _reversed_struct<I>(v);
}
template <typename I>
struct _range_struct {
  const I first_, last_;
  explicit _range_struct(const I first, const I last)
      : first_{first}, last_{last} {}
  I begin() const { return first_; }
  I end() const { return last_; }
};
template <typename I>
_range_struct<I> range(const I first, const I last) {
  return _range_struct<I>(first, last);
}
}  // namespace __algorithm
using namespace __algorithm;
namespace __io {
void setIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << setprecision(15);
}
}  // namespace __io
using namespace __io;
struct union_find_bipartite {
  struct node {
    int parent, rank, size, status;
    bool parent_edge_parity;
    bool is_bipartite;
    int ct_nodes_on_root_side;
    node() {}
    node(int id)
        : parent(id),
          rank(0),
          size(1),
          status(-1),
          parent_edge_parity(0),
          is_bipartite(true),
          ct_nodes_on_root_side(1) {}
    int count_bipartitions() const {
      return !is_bipartite ? 0 : status == -1 ? 2 : 1;
    }
    int min_nodes_on_side_1() const {
      switch (status) {
        case 1:
          return ct_nodes_on_root_side;
        case 0:
          return size - ct_nodes_on_root_side;
        case -1:
          return std::min(ct_nodes_on_root_side, size - ct_nodes_on_root_side);
        default:
          assert(false);
      }
    }
  };
  int ct_components, ct_bipartite_components, degrees_of_freedom,
      min_nodes_on_side_1;
  mutable std::vector<node> data;
  union_find_bipartite(int N = 0)
      : ct_components(N),
        ct_bipartite_components(N),
        degrees_of_freedom(N),
        min_nodes_on_side_1(0),
        data(N) {
    iota(data.begin(), data.end(), 0);
  }

 private:
  void subtract_component(int u) {
    ct_components--;
    if (data[u].is_bipartite) {
      ct_bipartite_components--;
      degrees_of_freedom -= data[u].status == -1;
      min_nodes_on_side_1 -= data[u].min_nodes_on_side_1();
    }
  }
  void add_component(int u) {
    ct_components++;
    if (data[u].is_bipartite) {
      ct_bipartite_components++;
      degrees_of_freedom += data[u].status == -1;
      min_nodes_on_side_1 += data[u].min_nodes_on_side_1();
    }
  }

 public:
  int find(int u) const {
    if (u == data[u].parent) return u;
    find(data[u].parent);
    data[u].parent_edge_parity ^= data[data[u].parent].parent_edge_parity;
    return data[u].parent = data[data[u].parent].parent;
  }
  bool can_constrain_node_to_side(int u, bool side) const {
    find(u);
    side ^= data[u].parent_edge_parity;
    u = data[u].parent;
    return data[u].is_bipartite &&
           (data[u].status == -1 || data[u].status == side);
  }
  bool constrain_node_to_side(int u, bool side) {
    find(u);
    side ^= data[u].parent_edge_parity;
    u = data[u].parent;
    subtract_component(u);
    if (data[u].status == -1) {
      data[u].status = side;
    } else {
      data[u].is_bipartite &= data[u].status == side;
    }
    add_component(u);
    return data[u].is_bipartite;
  }
  bool can_add_constraint_on_nodes(int u, int v, bool edge_parity) const {
    find(u);
    edge_parity ^= data[u].parent_edge_parity;
    u = data[u].parent;
    find(v);
    edge_parity ^= data[v].parent_edge_parity;
    v = data[v].parent;
    return data[u].is_bipartite && data[v].is_bipartite &&
           (data[u].status == -1 || data[v].status == -1 ||
            (data[u].status ^ data[v].status) == edge_parity);
  }
  struct result {
    bool added_connectivity;
    bool component_is_bipartite;
  };
  result unite(int u, int v, bool edge_parity) {
    find(u);
    edge_parity ^= data[u].parent_edge_parity;
    u = data[u].parent;
    find(v);
    edge_parity ^= data[v].parent_edge_parity;
    v = data[v].parent;
    if (u == v) {
      subtract_component(u);
      if (edge_parity) data[u].is_bipartite = false;
      add_component(u);
      return {false, data[u].is_bipartite};
    }
    if (data[u].rank < data[v].rank) std::swap(u, v);
    subtract_component(u);
    subtract_component(v);
    data[v].parent = u;
    data[v].parent_edge_parity = edge_parity;
    if (data[u].rank == data[v].rank) data[u].rank++;
    data[u].size += data[v].size;
    data[u].is_bipartite &= data[v].is_bipartite;
    if (edge_parity)
      data[u].ct_nodes_on_root_side +=
          data[v].size - data[v].ct_nodes_on_root_side;
    else
      data[u].ct_nodes_on_root_side += data[v].ct_nodes_on_root_side;
    if (data[v].status != -1) {
      bool implied_u_status = data[v].status ^ edge_parity;
      if (data[u].status == -1)
        data[u].status = implied_u_status;
      else
        data[u].is_bipartite &= data[u].status == implied_u_status;
    }
    add_component(u);
    return {true, data[u].is_bipartite};
  }
  bool can_constrain_to_be_same(int u, int v) const {
    return can_add_constraint_on_nodes(u, v, 0);
  }
  bool can_constrain_to_be_different(int u, int v) const {
    return can_add_constraint_on_nodes(u, v, 1);
  }
  result constrain_to_be_same(int u, int v) { return unite(u, v, 0); }
  result constrain_to_be_different(int u, int v) { return unite(u, v, 1); }
};
const string NO = "NO", YES = "YES";
int main() {
  setIO();
  int n, m;
  re(n, m);
  const int S = n * m;
  auto ind = [&](int i, int j) { return i * m + j; };
  auto row = [&](int i) { return i / m; };
  auto col = [&](int i) { return i % m; };
  vb marked(S);
  for (int i = 0; i < n; i++) {
    string line;
    re(line);
    for (int j = 0; j < m; j++) marked[ind(i, j)] = line[j] == 'X';
  }
  auto get_adj = [&](int i) {
    vi res;
    for (int j : {i + 1, i - 1, i + m, i - m}) {
      if (marked[j]) continue;
      res.push_back(j);
    }
    return res;
  };
  vi special;
  union_find_bipartite uf(S);
  for (int i = 0; i < S; i++) {
    if (!marked[i]) continue;
    auto adj = get_adj(i);
    if (int((adj).size()) == 0) continue;
    if (int((adj).size()) == 1 || int((adj).size()) == 3) {
      ps(NO);
      return 0;
    }
    if (int((adj).size()) == 4) {
      for (int u : adj) {
        for (int v : adj) {
          if (u == v) continue;
          uf.unite(u, v, !(row(u) == row(v) || col(u) == col(v)));
        }
      }
      continue;
    }
    uf.unite(adj.front(), adj.back(), 1);
  }
  if (uf.ct_bipartite_components != uf.ct_components) {
    ps(NO);
    return 0;
  }
  ps(YES);
  for (int i = 0; i < S; i++) {
    if (marked[i]) continue;
    if (uf.can_constrain_node_to_side(i, 0)) uf.constrain_node_to_side(i, 0);
  }
  vvi ans(n, vi(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int u = ind(i, j);
      if (marked[u]) continue;
      ans[i][j] = uf.can_constrain_node_to_side(u, 0) ? 1 : 4;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int u = ind(i, j);
      if (!marked[u]) continue;
      for (int v : get_adj(u)) ans[i][j] += ans[row(v)][col(v)];
      assert(ans[i][j] % 5 == 0);
    }
  }
  for (auto &i : ans) pc(i);
  return 0;
}

```