#include <bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<char> L(n), R(n), U(m), D(m);
    vector<vector<char>> a(n, vector<char>(m));
    for (int i = 0; i <= n + 1; ++i) {
        for (int j = 0; j <= m + 1; ++j) {
            char c;
            cin >> c;
            if (i >= 1 && i <= n && j >= 1 && j <= m) {
                a[i - 1][j - 1] = c;
            } else if (!i) {
                if (j >= 1 && j <= m)U[j - 1] = c == '.' ? 0 : c;
            } else if (i == n + 1) {
                if (j >= 1 && j <= m)D[j - 1] = c == '.' ? 0 : c;
            } else if (!j) {
                if (i >= 1 && i <= n)L[i - 1] = c == '.' ? 0 : c;
            } else if (j == m + 1) {
                if (i >= 1 && i <= n)R[i - 1] = c == '.' ? 0 : c;
            }
        }
    }
    auto letthemend = [] {
        cout << "NO\n";
        exit(0);
    };
    vector<vector<char>> res(n, vector<char>(m, '.'));
    vector<int> l(n), r(n, m - 1), u(m), d(m, n - 1);
    for (int i = 0; i < n; ++i) {
        if (L[i])while (l[i] < m && a[i][l[i]] == 'x')++l[i];
        else l[i] = -1;
        if (R[i])while (r[i] >= 0 && a[i][r[i]] == 'x')--r[i];
        else r[i] = m;
    }
    queue<int> q;
    for (int j = 0; j < m; ++j)q.push(j);
    for (int j = m - 1; ~j; --j)q.push(j);
    while (q.size()) {
        int j = q.front();
        q.pop();
        if (j < 0 || j >= m)continue;
        if (U[j]) {
            for (; u[j] < n; ++u[j]) {
                if (a[u[j]][j] == 'x' || l[u[j]] > j)continue;
                if (l[u[j]] < j || L[u[j]] == U[j])break;
                ++l[u[j]];
                while (l[u[j]] < m && a[u[j]][l[u[j]]] == 'x')++l[u[j]];
                q.push(l[u[j]]);
            }
        }
        if (D[j]) {
            for (; ~d[j]; --d[j]) {
                if (a[d[j]][j] == 'x' || l[d[j]] > j)continue;
                if (l[d[j]] < j || L[d[j]] == D[j])break;
                ++l[d[j]];
                while (l[d[j]] < m && a[d[j]][l[d[j]]] == 'x')++l[d[j]];
                q.push(l[d[j]]);
            }
        }
        if (U[j]) {
            for (; u[j] < n; ++u[j]) {
                if (a[u[j]][j] == 'x' || r[u[j]] < j)continue;
                if (r[u[j]] > j || R[u[j]] == U[j])break;
                --r[u[j]];
                while (r[u[j]] >= 0 && a[u[j]][r[u[j]]] == 'x')--r[u[j]];
                q.push(r[u[j]]);
            }
        }
        if (D[j]) {
            for (; ~d[j]; --d[j]) {
                if (a[d[j]][j] == 'x' || r[d[j]] < j)continue;
                if (r[d[j]] > j || R[d[j]] == D[j])break;
                --r[d[j]];
                while (r[d[j]] >= 0 && a[d[j]][r[d[j]]] == 'x')--r[d[j]];
                q.push(r[d[j]]);
            }
        }
    }
    for (int j = 0; j < m; ++j)if (u[j] > d[j] || (u[j] == d[j] && U[j] != D[j]))letthemend();
    for (int i = 0; i < n; ++i)if (l[i] > r[i] || (l[i] == r[i] && L[i] != R[i]))letthemend();
    for (int i = 0; i < n; ++i) {
        if (L[i])res[i][l[i]] = L[i];
        if (R[i])res[i][r[i]] = R[i];
    }
    for (int j = 0; j < m; ++j) {
        if (U[j])res[u[j]][j] = U[j];
        if (D[j])res[d[j]][j] = D[j];
    }
    cout << "YES\n";
    for (auto &i: res) {
        for (auto &j: i)cout << j;
        cout << "\n";
    }
}