#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pii pair<int, int>
#define endl '\n'
#define all(a) a.begin(), a.end()
const int maxi = 2e5 + 10;
const int mod = 1e9 + 7;
const int N=2600;

vector<int> G[N];
int n, m;
int match[N],vis[N];
char s[110][110];
int v[110][110];
int dx[4] = {0, 0, 2, -2}, dy[4] = {2, -2, 0, 0};
void dfs(int r,int c,int f){
    int rr = 2 * r + 1, cc = 2 * c + 1;
    v[rr][cc] = 1;
    if(rr==1||rr==2*n-1||cc==1||cc==2*m-1){
        for (int i = 0; i < 4;i++){
            int r1 = rr + dx[i], c1 = cc + dy[i];
            if(r1<1||r1>2*n-1||c1<1||c1>2*m-1) continue;
            int p = (r1 - 1) / 2 * m + (c1 - 1) / 2;
            if((r1!=1&&r1!=2*n-1&&c1!=1&&c1!=2*m-1)||(n==2&&(r1+rr)/2==2&&(c1+cc)/2!=1&&(c1+cc)/2!=2*m-1)||(m==2&&(c1+cc)/2==2&&(r1+rr)/2!=1&&(r1+rr)/2!=2*n-1)) continue;
            // cout << rr << " " << cc << " " << r1 << " " << c1 << endl;
            if((s[rr][cc]-'0')%2==0&&(s[r1][c1]-'0')%2==0){
                if(f)
                    G[r * m + c].push_back(p);
                if(!v[r1][c1])
                    dfs((r1 - 1) / 2, (c1 - 1) / 2, f ^ 1);
            }
        }
    }
    else{
        for (int i = 0; i < 4;i++){
            int r1 = rr + dx[i], c1 = cc + dy[i];
            if(r1<1||r1>2*n-1||c1<1||c1>2*m-1) continue;
            int p = (r1 - 1) / 2 * m + (c1 - 1) / 2;
            if(r1==1||r1==2*n-1||c1==1||c1==2*m-1) continue;
            if(s[rr][cc]=='7'&&s[r1][c1]=='7'){
                if(f)
                    G[r * m + c].push_back(p);
                if(!v[r1][c1])
                    dfs((r1 - 1) / 2, (c1 - 1) / 2, f ^ 1);
            }
        }
    }
}
bool hungary(int p,int op)
{
    if(vis[p]==op)
        return false;
    vis[p]=op;
    for(int i:G[p])
    {
        if(match[i]==-1||hungary(match[i],op))
        {
            match[i]=p;
            return true;
        }
    }
    return false;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t = 1;
    // cin >>t;
    while (t--)
    {
        memset(match, -1, sizeof(match));
        cin >> n >>m;
        for (int i = 1; i <= 2*n-1;i++){
            cin >> (s[i] + 1);
        }
        int tot = 0;
        for (int i = 0; i < n;i++){
            for (int j = 0;j<m;j++){
                if(i==0||i==n-1||j==0||j==m-1){
                    if(((i==0)+(i==n-1)+(j==0)+(j==m-1))==2&&s[i*2+1][j*2+1]=='2')
                        tot++;
                    else if(s[i*2+1][j*2+1]=='4')
                        tot++;
                }
                else if(s[i*2+1][j*2+1]=='7')
                    tot++;
                if(!v[2*i+1][2*j+1]){
                    dfs(i, j, 1);
                }
            }
        }
        /* for (int i = 0; i < n*m;i++){
            cout << "p" << i << endl;
            for(auto &it:G[i]){
                cout << it << " ";
            }
            cout << endl;
        } */
            // cout << "tot"<<tot << endl;
        int cnt = 0;
        for (int i = 0; i < n * m;i++){
            if(hungary(i,i+1))
                cnt++;
        }
        // cout << "cnt" << cnt<<endl;
        if(cnt*2==tot){
            cout << "YES" << endl;
            for (int i = 1; i <= 2 * n - 1;i++){
                for (int j = 1; j <= 2 * m - 1;j++){
                    if(s[i][j]=='.')
                        s[i][j] = '#';
                }
            }
            for (int i = 0; i < n * m; i++)
            {
                if (match[i] != -1)
                {
                    int r1 = i / m *2+1, c1 = i % m*2+1;
                    int r2 = match[i] / m *2 + 1, c2 = match[i] % m*2+1;
                    s[(r1 + r2) / 2][(c1 + c2) / 2] ='.';
                }   
            }
            for (int i = 1; i <= 2 * n - 1;i++){
                for (int j = 1; j <= 2 * m - 1;j++){
                    cout << s[i][j];
                }
                cout << endl;
            }
        }
        else
            cout << "NO" << endl;
    }   
}