#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    char c;
    vector<char> up(m, '.'), left(n, '.'), right(n, '.'), down(m, '.');
    vector<vector<char>> a(n, vector<char>(m, '.'));
    cin >> c;
    for (int i = 0; i < m; ++i) {
        cin >> up[i];
    }
    cin >> c;
    for (int i = 0; i < n; ++i) {
        cin >> left[i];
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
        }
        cin >> right[i];
    }
    cin >> c;
    for (int i = 0; i < m; ++i) {
        cin >> down[i];
    }
    cin >> c;

    vector<int> lid(n, 0), rid(n, m - 1), uid(m, 0), did(m, n - 1);

    auto L = [&](auto mark, int h) -> bool {
        char need = left[h];
        if (need == '.') {
            return true;
        }
        while (lid[h] < m) {
            if (a[h][lid[h]] == need) {
                return true;
            } else if (a[h][lid[h]] == 'x') {
                lid[h] += 1;
            } else if (a[h][lid[h]] != '.') {
                if (!mark(mark, h, lid[h])) {
                    return false;
                }
            } else {
                assert(a[h][lid[h]] == '.');
                a[h][lid[h]] = need;
                return true;
            }
        }
        return false;
    };
    auto R = [&](auto mark, int h) -> bool {
        char need = right[h];
        if (need == '.') {
            return true;
        }
        while (rid[h] >= 0) {
            if (a[h][rid[h]] == need) {
                return true;
            } else if (a[h][rid[h]] == 'x') {
                rid[h] -= 1;
            } else if (a[h][rid[h]] != '.') {
                if (!mark(mark, h, rid[h])) {
                    return false;
                }
            } else {
                assert(a[h][rid[h]] == '.');
                a[h][rid[h]] = need;
                return true;
            }
        }
        return false;
    };
    auto U = [&](auto mark, int w) -> bool {
        char need = up[w];
        if (need == '.') {
            return true;
        }
        while (uid[w] < n) {
            if (a[uid[w]][w] == need) {
                return true;
            } else if (a[uid[w]][w] == 'x') {
                uid[w] += 1;
            } else if (a[uid[w]][w] != '.') {
                if (!mark(mark, uid[w], w)) {
                    return false;
                }
            } else {
                assert(a[uid[w]][w] == '.');
                a[uid[w]][w] = need;
                return true;
            }
        }
        return false;
    };
    auto D = [&](auto mark, int w) -> bool {
        char need = down[w];
        if (need == '.') {
            return true;
        }
        while (did[w] >= 0) {
            if (a[did[w]][w] == need) {
                return true;
            } else if (a[did[w]][w] == 'x') {
                did[w] -= 1;
            } else if (a[did[w]][w] != '.') {
                if (!mark(mark, did[w], w)) {
                    return false;
                }
            } else {
                assert(a[did[w]][w] == '.');
                a[did[w]][w] = need;
                return true;
            }
        }
        return false;
    };
    auto mark = [&](auto self, int i, int j) -> bool {
        a[i][j] = 'x';
        return L(self, i) && R(self, i) && U(self, j) && D(self, j);
    };

    auto slv = [&]() -> bool {
        for (int i = 0; i < n; ++i) {
            if (!L(mark, i)) return false;
            if (!R(mark, i)) return false;
        }
        for (int i = 0; i < m; ++i) {
            if (!U(mark, i)) return false;
            if (!D(mark, i)) return false;
        }
        return true;
    };

    if (slv()) {
        cout << "YES\n";
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (a[i][j] == 'x') {
                    a[i][j] = '.';
                }
                cout << a[i][j];
            }
            cout << '\n';
        }
    } else {
        cout << "NO\n";
    }
}