#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
#define ll long long
// #define int ll
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mkp make_pair
typedef pair<int, int> pii;
const ll inf=LLONG_MAX;
const int maxn=2510;
#define F first
#define S second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef pair<ll,ll> pll;
typedef vector<string> vs;
typedef vector<pll> vpl;
typedef vector<int> vi;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());

template<int SZ> struct UnweightedMatch {
    int match[SZ], N; vi adj[SZ];
    void ae(int u, int v) { adj[u].pb(v), adj[v].pb(u); }
    void ae2(int u, int v) { adj[u].pb(v); }
    queue<int> q;
    int par[SZ], vis[SZ], orig[SZ], aux[SZ];
    void augment(int u, int v) { // toggle edges on u-v path
        while (1) { // one more matched pair
            int pv = par[v], nv = match[pv];
            match[v] = pv; match[pv] = v;
            v = nv; if (u == pv) return;
        }
    }
    int lca(int u, int v) { // find LCA of supernodes in O(dist)
        static int t = 0;
        for (++t;;swap(u,v)) {
            if (!u) continue;
            if (aux[u] == t) return u; // found LCA
            aux[u] = t; u = orig[par[match[u]]];
        }
    }
    void blossom(int u, int v, int a) { // go other way
        for (; orig[u] != a; u = par[v]) { // around cycle
            par[u] = v; v = match[u]; // treat u as if vis[u] = 1
            if (vis[v] == 1) vis[v] = 0, q.push(v);
            orig[u] = orig[v] = a; // merge into supernode
        }
    }
    bool bfs(int u) { // u is initially unmatched
        rep(i,1,N+1) par[i] = 0, vis[i] = -1, orig[i] = i;
        q = queue<int>(); vis[u] = 0, q.push(u);
        while (sz(q)) { // each node is pushed to q at most once
            int v = q.front(); q.pop(); // 0 -> unmatched vertex
            for(int x:adj[v]) {
                if (vis[x] == -1) { // neither of x, match[x] visited
                    vis[x] = 1; par[x] = v;
                    if (!match[x]) return augment(u,x),1;
                    vis[match[x]] = 0, q.push(match[x]);
                } else if (vis[x] == 0 && orig[v] != orig[x]) {
                    int a = lca(orig[v],orig[x]); // odd cycle
                    blossom(x,v,a), blossom(v,x,a); 
                } // contract O(n) times
            }
        }
        return 0;
    }
    int calc(int _N) { // rand matching -> constant improvement
        N = _N; rep(i,1,N+1) match[i] = aux[i] = 0; 
        int ans = 0; vi V(N); iota(all(V),1); shuffle(all(V),rng); // find rand matching
        for(int x:V) if (!match[x]) for(int y:adj[x]) if (!match[y]) { 
            match[x] = y, match[y] = x; ++ans; break; }
        rep(i,1,N+1) if (!match[i] && bfs(i)) ++ans;
        return ans;
    }
};

int dl[]={0,0,1,-1,-1,-1,1,1};
int dc[]={1,-1,0,0,-1,1,-1,1};
int dl2[]={0,0,2,-2};
int dc2[]={2,-2,0,0};

int grid[maxn][maxn];
int tot[maxn][maxn];

int nodes;
int x[maxn];
int y[maxn];
int node[maxn][maxn];

int n, m;

bool dentro(int i, int j)
{
    bool ret=true;
    if(i<3 || i>n-2 || j<3 || j>m-2)
        ret=false;
    return ret;
}

char ans[maxn][maxn];

int32_t main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout); 
    #endif
    ios::sync_with_stdio(0);cin.tie(0);

    cin>> n>> m;
    n=2*n-1;
    m=2*m-1;
    for(int i=1; i<=n; i++)
    {
        string s; cin>> s; 
        for(int j=1; j<=m; j++)
            if(i%2 && j%2)
                grid[i][j]=s[j-1]-'0';
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            for(int k=0; k<8; k++)
            {
                int il=i+dl[k];
                int jl=j+dc[k];
                if(il<1 || il>n || jl<1 || jl>m)
                    continue;
                tot[i][j]++;
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(dentro(i, j) && i%2 && j%2 && grid[i][j]!=tot[i][j])
            {
                node[i][j]=++nodes;
                x[node[i][j]]=i;
                y[node[i][j]]=j;
                // cout<< i<< " "<< j<< "\n";
            }
        }
    }
    UnweightedMatch<maxn> uwm;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(dentro(i, j) && i%2 && j%2 && grid[i][j]!=tot[i][j])
            {
                for(int k=0; k<4; k++)
                {
                    int il=i+dl2[k];
                    int jl=j+dc2[k];
                    if(!dentro(il, jl))
                        continue;
                    if(grid[il][jl]==tot[il][jl])
                        continue;
                    uwm.ae2(node[i][j], node[il][jl]);
                }
            }
        }
    }
    int qntd=uwm.calc(nodes);
    // cout<< nodes<< "\n";
    // for(int i=1; i<=nodes; i++)
    // {
    //     cout<< i<< " "<< x[i]<< " "<< y[i]<< "\n";
    // }
    // for(int i=1; i<=nodes; i++)
    // {
    //     cout<< i<< " "<< uwm.match[i]<< "\n";
    // }
    if(nodes%2 || qntd!=nodes/2)
    {
        cout<< "NO\n";
        return 0;
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(i%2 && j%2)
                ans[i][j]=grid[i][j]+'0';
            else
                ans[i][j]='#';
        }
    }
    for(int i=1; i<=nodes; i++)
    {
        int j=uwm.match[i];
        if(i>j)
            continue;
        // cout<< x[i]<< " "<< y[i]<< " "<< x[j]<< " "<< y[j]<< "\n";
        int mx=(x[i]+x[j])/2;
        int my=(y[i]+y[j])/2;
        ans[mx][my]='.';
    }
    nodes=0;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(!dentro(i, j) && i%2 && j%2 && grid[i][j]!=tot[i][j])
            {
                node[i][j]=++nodes;
                x[node[i][j]]=i;
                y[node[i][j]]=j;
            }
        }
    }
    UnweightedMatch<maxn> uwm2;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(!dentro(i, j) && i%2 && j%2 && grid[i][j]!=tot[i][j])
            {
                for(int k=0; k<4; k++)
                {
                    int il=i+dl2[k];
                    int jl=j+dc2[k];
                    if(il<1 || il>n || jl<1 || jl>m || dentro(il, jl))
                        continue;
                    if(grid[il][jl]==tot[il][jl])
                        continue;
                    int mx=(i+il)/2;
                    int my=(j+jl)/2;
                    if(mx==1 || mx==n || my==1 || my==m)
                    {
                        uwm2.ae2(node[i][j], node[il][jl]);
                        // cout<< node[i][j]<< " "<< node[il][jl]<< endl;
                    }
                }
            }
        }
    }
    qntd=uwm2.calc(nodes);
    // cout<< nodes<< "\n";
    // for(int i=1; i<=nodes; i++)
    // {
    //     cout<< i<< " "<< x[i]<< " "<< y[i]<< "\n";
    // }
    // for(int i=1; i<=nodes; i++)
    // {
    //     cout<< i<< " "<< uwm2.match[i]<< "\n";
    // }
    if(nodes%2 || qntd!=nodes/2)
    {
        cout<< "NO\n";
        return 0;
    }
    for(int i=1; i<=nodes; i++)
    {
        int j=uwm2.match[i];
        if(i>j)
            continue;
        // cout<< x[i]<< " "<< y[i]<< " "<< x[j]<< " "<< y[j]<< "\n";
        int mx=(x[i]+x[j])/2;
        int my=(y[i]+y[j])/2;
        ans[mx][my]='.';
    }
    cout<< "YES\n";
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
            cout<< ans[i][j];
        cout<< "\n";
    }
 
    return 0;
}