#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 <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; }


namespace bm {
constexpr int LIM_N0 = 100'010;
constexpr int LIM_N1 = 100'010;
constexpr int LIM_M = 100'010;
int n0, n1, m, as[LIM_M], bs[LIM_M];
int to[LIM_N0], fr[LIM_N1], tof;
int pt[LIM_N0 + 2], zu[LIM_M], used[LIM_N0], lev[LIM_N0], que[LIM_N0], *qb, *qe;
void init(int n0_, int n1_) {
  n0 = n0_; n1 = n1_; m = 0;
}
int ae(int u, int v) {
  as[m] = u; bs[m] = v; return m++;
}
int augment(int u) {
  used[u] = tof;
  for (int j = pt[u]; j < pt[u + 1]; ++j) {
    const int v = zu[j];
    const int w = fr[v];
    if (!~w || (used[w] != tof && lev[u] < lev[w] && augment(w))) {
      to[u] = v; fr[v] = u; return 1;
    }
  }
  return 0;
}
int run() {
  memset(pt, 0, (n0 + 2) * sizeof(int));
  for (int i = 0; i < m; ++i) ++pt[as[i] + 2];
  for (int u = 2; u <= n0; ++u) pt[u + 1] += pt[u];
  for (int i = 0; i < m; ++i) zu[pt[as[i] + 1]++] = bs[i];
  memset(to, ~0, n0 * sizeof(int));
  memset(fr, ~0, n1 * sizeof(int));
  memset(used, ~0, n0 * sizeof(int));
  for (tof = 0; ; ) {
    qb = qe = que; memset(lev, ~0, n0 * sizeof(int));
    for (int u = 0; u < n0; ++u) if (!~to[u]) lev[*qe++ = u] = 0;
    for (; qb != qe; ) {
      const int u = *qb++;
      for (int j = pt[u]; j < pt[u + 1]; ++j) {
        const int w = fr[zu[j]];
        if (~w && !~lev[w]) lev[*qe++ = w] = lev[u] + 1;
      }
    }
    int f = 0;
    for (int u = 0; u < n0; ++u) if (!~to[u]) f += augment(u);
    if (!f) return tof;
    tof += f;
  }
}

// s: true, t: false (s: reachable from unmatched left)
// vertex cover: (0: false, 0: true)
// independent set: (0: true, 1: false)
bool side0[LIM_N0], side1[LIM_N1];
void dfs(int u) {
  if (!side0[u]) {
    side0[u] = true;
    for (int j = pt[u]; j < pt[u + 1]; ++j) {
      const int v = zu[j];
      if (!side1[v]) {
        side1[v] = true;
        const int w = fr[v];
        if (~w) dfs(w);
      }
    }
  }
}
void minCut() {
  memset(side0, 0, n0 * sizeof(bool));
  memset(side1, 0, n1 * sizeof(bool));
  for (int u = 0; u < n0; ++u) if (!~to[u]) dfs(u);
}
}  // namespace bm


int M, N;
char A[110][110];

int ids[110][110];
pair<int, int> edge[110][110];

int main() {
  for (; ~scanf("%d%d", &M, &N); ) {
    for (int x = 0; x < 2 * M - 1; ++x) {
      scanf("%s", A[x]);
    }
    
    auto side = [&](int x, int y) -> int {
      return ((x>>1) + (y>>1)) & 1;
    };
    int V[2] = {};
    memset(ids, ~0, sizeof(ids));
    memset(edge, ~0, sizeof(edge));
    for (int x = 0; x < 2 * M - 1; x += 2) for (int y = 0; y < 2 * N - 1; y += 2) {
      const bool fX = (x == 0 || x == 2 * M - 2);
      const bool fY = (y == 0 || y == 2 * N - 2);
      const int deg = (fX && fY) ? 3 : (fX || fY) ? 5 : 8;
      if (A[x][y] - '0' < deg) {
        ids[x][y] = V[side(x, y)]++;
      }
    }
    bm::init(V[0], V[1]);
    for (int x = 1; x < 2 * M - 1; x += 2) for (int y = 0; y < 2 * N - 1; y += 2) {
      if (!(x == 1 || x == 2 * M - 3) || (y == 0 || y == 2 * N - 2)) {
        int u = ids[x - 1][y];
        int v = ids[x + 1][y];
        if (~u && ~v) {
          if (side(x - 1, y)) {
            swap(u, v);
          }
          edge[x][y] = make_pair(u, v);
          bm::ae(u, v);
        }
      }
    }
    for (int x = 0; x < 2 * M - 1; x += 2) for (int y = 1; y < 2 * N - 1; y += 2) {
      if (!(y == 1 || y == 2 * N - 3) || (x == 0 || x == 2 * M - 2)) {
        int u = ids[x][y - 1];
        int v = ids[x][y + 1];
        if (~u && ~v) {
          if (side(x, y - 1)) {
            swap(u, v);
          }
          edge[x][y] = make_pair(u, v);
          bm::ae(u, v);
        }
      }
    }
    const int res = bm::run();
    if (res == V[0] && res == V[1]) {
      for (int x = 0; x < 2 * M - 1; ++x) for (int y = 0; y < 2 * N - 1; ++y) {
        if (A[x][y] == '.') {
          A[x][y] = '#';
        }
      }
      for (int x = 0; x < 2 * M - 1; ++x) for (int y = 0; y < 2 * N - 1; ++y) {
        const int u = edge[x][y].first;
        const int v = edge[x][y].second;
        if (~u && ~v && bm::to[u] == v) {
          A[x][y] = '.';
        }
      }
      
      puts("YES");
      for (int x = 0; x < 2 * M - 1; ++x) {
        puts(A[x]);
      }
    } else {
      puts("NO");
    }
  }
  return 0;
}