#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int inf = 0x3f3f3f3f;

const int N = 1e6 + 10;
const int M = 1e2 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int s, t, head[N], tot, d[N], now[N];
struct node { int nxt, to, f; } e[N];
void adde(int u, int v, int f) {
  // cout << "u, v, f = " << u << ' ' << v << ' ' << f << endl;
  e[++ tot] = (node) { head[u], v, f }, head[u] = tot;
  e[++ tot] = (node) { head[v], u, 0 }, head[v] = tot;
}

bool bfs() {
  rep(i, s, t) d[i] = inf, now[i] = head[i];
  queue <int> q;
  d[s] = 0, q.push(s);
  while (q.size()) {
    int u = q.front(); q.pop();
    for (int i = head[u]; i; i = e[i].nxt) {
      int v = e[i].to;
      if (!e[i].f || d[v] != inf) continue;
      d[v] = d[u] + 1, q.push(v);
    }
  }
  return d[t] < inf;
}

int dfs(int u, int flow) {
  if (u == t) return flow;
  int lim = flow;
  for (int i = now[u]; i; i = e[i].nxt, now[u] = i) {
    int v = e[i].to;
    if (!e[i].f || d[v] != d[u] + 1) continue;
    int k = dfs(v, min(e[i].f, lim));
    lim -= k, e[i].f -= k, e[i ^ 1].f += k;
    if (!lim) break;
  }
  return flow - lim;
}

int dinic() {
  int res = 0;
  while (bfs()) res += dfs(s, inf);
  return res;
}

int n, m, a[M][M], cnt;
char str[M][M];

int id(int i, int j) { return m * (i - 1) + j; }

int main() {
  n = read(), m = read();
  s = 0, t = n * m + 1, tot = 1;
  rep(i, 1, n) rep(j, 1, m) {
    a[i][j] = read();
    if (a[i][j] == 2 || a[i][j] == 4 || a[i][j] == 7) {
      ++ cnt;
      if (i + j & 1) adde(s, id(i, j), 1);
      else adde(id(i, j), t, 1);
    }
  }
  rep(i, 1, n - 1) {
    if (i + 1 & 1) adde(id(i, 1), id(i + 1, 1), 1);
    else adde(id(i + 1, 1), id(i, 1), 1);
    if (i + m & 1) adde(id(i, m), id(i + 1, m), 1);
    else adde(id(i + 1, m), id(i, m), 1);
  }
  rep(j, 1, m - 1) {
    if (1 + j & 1) adde(id(1, j), id(1, j + 1), 1);
    else adde(id(1, j + 1), id(1, j), 1);
    if (n + j & 1) adde(id(n, j), id(n, j + 1), 1);
    else adde(id(n, j + 1), id(n, j), 1);
  }
  rep(i, 2, n - 1) rep(j, 2, m - 1) {
    if (i < n - 1) {
      if (i + j & 1) adde(id(i, j), id(i + 1, j), 1);
      else adde(id(i + 1, j), id(i, j), 1);
    }
    if (j < m - 1) {
      if (i + j & 1) adde(id(i, j), id(i, j + 1), 1);
      else adde(id(i, j + 1), id(i, j), 1);
    }
  }
  int res = dinic();
  // pv(res);
  if (res * 2 != cnt) return printf("NO\n"), 0;
  printf("YES\n");
  rep(i, 1, 2 * n - 1) rep(j, 1, 2 * m - 1) str[i][j] = '#';
  rep(i, 1, n) rep(j, 1, m) {
    str[2 * i - 1][2 * j - 1] = '0' + a[i][j];
    if (i + j & 1) for (int k = head[id(i, j)], v; k; k = e[k].nxt) {
      if (e[k].f) continue;
      v = e[k].to;
      if (v == s || v == t) continue;
      if (v == id(i, j) + 1) str[2 * i - 1][2 * j] = '.';
      else if (v == id(i, j) - 1) str[2 * i - 1][2 * j - 2] = '.';
      else if (v == id(i, j) + m) str[2 * i][2 * j - 1] = '.';
      else if (v == id(i, j) - m) str[2 * i - 2][2 * j - 1] = '.';
    }
  }
  rep(i, 1, 2 * n - 1) printf("%s\n", str[i] + 1);
  return 0;
}