#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
char c[3000][3000]; int cnt = 0; pii loc[25200]; map<pii, int> mp; int ecnt = 0; 
vector<int> g[25200]; int to[150020], from[150020], cap[150020], S, T, dep[150020], cur[150020]; 
void add(int x, int y, int w) {
  //  cerr << x << " " << y << " " << w << endl;
    g[x].push_back(ecnt); to[ecnt] = y; from[ecnt] = x; cap[ecnt] = w; ecnt ++; 
    g[y].push_back(ecnt); to[ecnt] = x; from[ecnt] = y; cap[ecnt] = 0; ecnt ++; 
}
void addedge(int x, int y, int xx, int yy) {
    if(!mp.count({x, y})){loc[++cnt] = {x, y}; mp[{x,y}] = cnt; }if(!mp.count({xx, yy})){loc[++cnt] = {xx, yy}; mp[{xx, yy}] = cnt; } 
    if((x + y) % 4 == 0) add(mp[{x,y}], mp[{xx,yy}], 1); else add(mp[{xx,yy}], mp[{x,y}], 1); 
    
}
void connect(int x, int y, int xx, int yy) {
    c[(x + xx) / 2][(y + yy) / 2] = '.';
}
bool bfs() {
    f(i, S, T) {dep[i] = inf; cur[i] = 0; } dep[S] = 0; queue<int> q; q.push(S); 
    while(!q.empty()) {
        int now = q.front(); q.pop(); //cerr << "reach: " << now << endl; 
        for(int i : g[now]) {
        //    cerr << "edge: " << i << ", cap : " << cap[i] << endl; 
            if(cap[i] == 0) continue; 
            else if(dep[to[i]] == inf) {dep[to[i]] = dep[now] + 1; q.push(to[i]);}
        }
    }
    return dep[T] < inf; 
}
int getflow(int x, int limit) {
    if(x == T) return limit; 
    int flow = 0; for(int it = cur[x]; it < (int)g[x].size() && flow < limit; it ++) {
        cur[x] = it; int i = g[x][it]; if(cap[i] == 0 || dep[to[i]] != dep[x] + 1) continue; 
        int tmp = getflow(to[i], min(limit - flow, cap[i])); if(tmp == 0) dep[to[i]] = -1;
        flow += tmp; cap[i] -= tmp; cap[i ^ 1] += tmp; 
    }
    return flow; 
}
int dinic() {
    int maxflow = 0; while(bfs()) {maxflow += getflow(S, inf); } return maxflow;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n, m; cin >> n >> m; f(i, 1, 2 * n - 1) f(j, 1, 2 * m - 1) {cin >> c[i][j]; if(c[i][j] == '.') c[i][j] = '#';}
    auto ng = [=](char ch) {return ch == '2' || ch == '4'; }; auto sv = [=](char ch) {return ch == '7';};  int ccnt = 0;
    f(i, 1, 2 * n - 1) f(j, 1, 2 * m - 1) if(ng(c[i][j]) || sv(c[i][j])) ccnt ++; 
  // cerr << "ccnt = " << ccnt << endl; 
    f(i, 1, 2 * n - 1) f(j, 1, 2 * m - 1) {
        if(c[i][j] == '2'){if(j + 2 <= 2 * m - 1 && ng(c[i][j + 2])) {addedge(i, j, i, j + 2);} if(i + 2 <= 2 * n - 1 && ng(c[i + 2][j])) {addedge(i, j, i + 2, j);}}
        else if(c[i][j] == '4') {if(j + 2 <= 2 * m - 1 && ng(c[i][j + 2]) && (i == 1 || i == 2 * n - 1)) {addedge(i, j, i, j + 2);} if(i + 2 <= 2 * n - 1 && ng(c[i + 2][j]) && (j == 1 || j == 2 * m - 1)) {addedge(i, j, i + 2, j);}}
        else if(c[i][j] == '7') {if(j + 2 <= 2 * m - 1 && sv(c[i][j + 2])) {addedge(i, j, i, j + 2);} if(i + 2 <= 2 * n - 1 && sv(c[i + 2][j])) {addedge(i, j, i + 2, j);} }
    }
  //  f(i, 1, cnt) cerr << i << " refers to " << loc[i].first << " " << loc[i].second << endl; 
    int ee = ecnt; S = 0; T = cnt + 1; f(i, 1, cnt) if((loc[i].first + loc[i].second) % 4 == 0) add(S, i, 1); else add(i, T, 1);
    //cerr << cnt <<" " << ecnt << endl; 
    if(dinic() * 2 != ccnt) {cout << "NO\n"; return 0; } 
    for(int i = 0; i < ee; i += 2) {if(cap[i] == 0) {connect(loc[from[i]].first, loc[from[i]].second, loc[to[i]].first, loc[to[i]].second);}}
    cout << "YES\n";
    f(i, 1, 2 * n - 1) {f(j, 1, 2 * m - 1) {cout << c[i][j]; }cout << endl;}
    
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}
/*
2023/x/xx
start thinking at h:mm


start coding at h:mm
finish debugging at h:mm
*/