#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef double db;

const int N = 107;

int n, m;
string S[N];
int mp[N][N], cnt;
int timeq, dfn[N * N], match[N * N];
vector<int> g[N];
int tag[N * N];

bool dfs(int u)
{
    for (int v : g[u])
    {
        if (dfn[v] == timeq)
            continue;
        dfn[v] = timeq;
        if (!match[v] || dfs(match[v]))
        {
            match[v] = u;
            return true;
        }
    }
    return false;
}

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

bool check(int i, int j)
{
    return ((i / 2) & 1) ^ ((j / 2) & 1);
}

int main()
{
    // ios::sync_with_stdio(false);
    cin >> n >> m;
    n--, m--;
    for (int i = 0; i <= 2 * n; i++)
        cin >> S[i];
    for (int i = 0; i <= 2 * n; i += 2)
        for (int j = 0; j <= 2 * m; j += 2)
        {
            mp[i][j] = ++cnt;
            if ((!i || i == 2 * n) && (!j || j == 2 * m) && S[i][j] == '2')
                tag[cnt] = 1;
            else if ((!i || !j || i == 2 * n || j == 2 * m) && S[i][j] == '4')
                tag[cnt] = 2;
            else if (S[i][j] == '7')
                tag[cnt] = 3;
        }
    // for (int i = 1; i <= cnt; i++)
    //     cout << tag[i] << " ";
    // cout << endl;
    // return 0;
    int w = 0;
    for (int i = 0; i <= 2 * n; i += 2)
        for (int j = 0; j <= 2 * m; j += 2)
            w += (check(i, j) > 0 ? 1 : -1) * (tag[mp[i][j]] > 0);
    if (w)
    {
        cout << "NO";
        return 0;
    }
    for (int i = 0; i <= 2 * n; i += 2)
        for (int j = 0; j <= 2 * m; j += 2)
        {
            if (check(i, j) || !tag[mp[i][j]])
                continue;
            for (int k = 0; k < 4; k++)
            {
                int xx = i + 2 * dx[k],
                    yy = j + 2 * dy[k];
                if (xx < 0 || xx > 2 * n || yy < 0 || yy > 2 * m || !tag[mp[xx][yy]])
                    continue;
                if ((tag[mp[i][j]] == 3) ^ (tag[mp[xx][yy]] != 3))
                    g[mp[i][j]].push_back(mp[xx][yy]);
            }
        }
    for (int i = 0; i <= 2 * n; i += 2)
        for (int j = 0; j <= 2 * m; j += 2)
        {
            if (check(i, j) || !tag[mp[i][j]])
                continue;
            timeq++;
            if (!dfs(mp[i][j]))
            {
                cout << "NO";
                return 0;
            }
        }
    cout << "YES\n";
    for (int i = 0; i <= 2 * n; i += 2)
        for (int j = 0; j <= 2 * m; j += 2)
            if (check(i, j) && tag[mp[i][j]])
            {
                const int &ret = mp[i][j];
                if (ret - 1 == match[ret])
                    S[i][j - 1] = '!';
                else if (ret + 1 == match[ret])
                    S[i][j + 1] = '!';
                else if (ret + m + 1 == match[ret])
                    S[i + 1][j] = '!';
                else
                    S[i - 1][j] = '!';
            }
    for (int i = 0; i <= 2 * n; i++)
        for (int j = 0; j <= 2 * m; j++)
            if (S[i][j] == '!')
                S[i][j] = '.';
            else if (S[i][j] == '.')
                S[i][j] = '#';
    // cout << "!!!" ;
    for (int i = 0; i <= 2 * n; i++)
        cout << S[i] << endl;
}