#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> pos(m, -1);
    vector<int> l(n), r(n);
    auto active = U;
    for (int i = 0; i < n; ++i) {
        l[i] = m, r[i] = -1;
        if (!L[i])l[i] = -1;
        if (!R[i])r[i] = m;
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == 'x')continue;
            if (active[j]) {
                if (U[j] == L[i]) l[i] = min(l[i], j);
                if (U[j] == R[i]) r[i] = max(r[i], j);
            } else {
                l[i] = min(l[i], j);
                r[i] = max(r[i], j);
            }
        }
        if (l[i] > r[i] || (l[i] == r[i] && L[i] != R[i])) letthemend();
        if (l[i] >= 0) res[i][l[i]] = L[i];
        if (r[i] < m) res[i][r[i]] = R[i];
        for (int j = max(0, l[i]); j <= min(m - 1, r[i]); ++j) {
            if (a[i][j] == '.' && active[j]) {
                active[j] = 0;
                pos[j] = i;
                res[i][j] = U[j];
            }
        }
    }
    for (auto x: active)if (x)letthemend();
    active = D;
    for (int i = n - 1; ~i; --i) {
        for (int j = 0; j < m; ++j) {
            if (active[j] && pos[j] == i && U[j] != D[j])letthemend();
        }
        while (l[i] >= 0 && l[i] < m) {
            if (active[l[i]] && D[l[i]] != L[i]) {
                res[i][l[i]] = '.';
                ++l[i];
                for (; l[i] < m; ++l[i]) {
                    if (a[i][l[i]] == 'x')continue;
                    if (res[i][l[i]] == '.' || res[i][l[i]] == L[i]) {
                        res[i][l[i]] = L[i];
                        break;
                    }
                    letthemend();
                }
            }
            else break;
        }
        if (l[i] == m)letthemend();
        while (r[i] >= 0 && r[i] < m) {
            if (active[r[i]] && D[r[i]] != R[i]) {
                res[i][r[i]] = '.';
                --r[i];
                for (; r[i] >= 0; --r[i]) {
                    if (a[i][r[i]] == 'x')continue;
                    if (res[i][r[i]] == '.' || res[i][r[i]] == R[i]) {
                        res[i][r[i]] = R[i];
                        break;
                    }
                    letthemend();
                }
            }
            else break;
        }
        if (r[i] == -1)letthemend();
        if (l[i] > r[i] || (l[i] == r[i] && L[i] != R[i])) letthemend();
        for (int j = max(0, l[i]); j <= min(m - 1, r[i]); ++j) {
            if (a[i][j] == '.' && active[j]) {
                active[j] = 0;
                res[i][j] = D[j];
            }
        }
    }
    for (auto x: active)if (x)letthemend();
    cout << "YES\n";
    for (auto &i: res) {
        for (auto &j: i)cout << j;
        cout << "\n";
    }
}