#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int MAXN=55;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, -1, 0, 1};

char s[MAXN * 2][MAXN * 2];
int a[MAXN][MAXN];
bool vis[MAXN * MAXN];
int lft[MAXN * MAXN];
vector<int> G[MAXN * MAXN];

bool Check(int x1, int y1, int x2 ,int y2, int n, int m) {
  if (s[x1 * 2][y1 * 2] == '2' || s[x2 * 2][y2 * 2] == '2') {
    return true;
  }

  if (x1 == x2) {
    if (y1 > y2) {
      swap(y1, y2);
    }

    if (y1 == 0 || y2 == m - 1) {
      return false;
    }
  } else {
    if (x1 > x2) {
      swap(x1, x2);
    }

    if (x1 == 0 || x2 == n - 1) {
      return false;
    }
  }

  return true;
}

bool match(int u) {
  for (int v : G[u]) {
    if (!vis[v]) {
      vis[v] =true;

      if (lft[v] == -1 || match(lft[v])) {
        lft[v] = u;
        
        return true;
      }
    }
  }

  return false;
}

int main() {
#ifdef KeyID
  freopen("read.txt","r",stdin);
#endif

  int n, m;
  scanf("%d%d",&n,&m);

  for (int i = 0; i < n * 2 - 1; i++) {
    scanf("%s",s[i]);
  }

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = s[i * 2][j * 2] - '0';

      if (a[i][j] <= 3) {
        a[i][j] = 3 - a[i][j];
      } else if (a[i][j] <= 5) {
        a[i][j] = 5 - a[i][j];
      } else {
        a[i][j] = 8 - a[i][j];
      }
    }
  }

  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if ((i + j & 1) && a[i][j]) {
        for (int k = 0; k < 4; k++) {
          int u = i + dx[k], v = j + dy[k];

          if (u >= 0 && u < n && v >= 0 && v < m && a[u][v]) {
            if (Check(i, j, u, v, n, m)) {
              G[i * m + j].pb(u * m + v);
            }

          }
        }
      }
    }

  memset(lft, -1, sizeof(lft));
  
  int cnt = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (a[i][j]) {
        cnt++;

        if (i + j & 1) {
          fill_n(vis, n * m, false);

          if (match(i * m + j)) {
            cnt -= 2;
          }
        }
      }
    }

  if (cnt != 0) {
    puts("NO");
  } else {
    puts("YES");

    for (int i = 0; i < 2 * n - 1; i++) {
      for (int j = 0; j < 2 * m - 1; j++) {
        if (s[i][j] == '.') {
          s[i][j] = '#';
        }
      }
    }

    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) {
        int v = i * m + j;

        if (lft[v] != -1) {
          int x = lft[v] / m, y = lft[v] % m;

          s[i + x][j + y] = '.';
        }
      }
    
    for (int i = 0; i < n * 2 - 1; i++) {
      puts(s[i]);
    }
  }
  
  return 0;
}