#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

struct Bipartite_Matching {
    vector<vector<int>> es;
    vector<int> d, match;
    vector<bool> used, used2;
    const int n, m;

    Bipartite_Matching(int n, int m) : es(n), d(n), match(m), used(n), used2(n), n(n), m(m) {}

    void add_edge(int u, int v) { es[u].push_back(v); }

    void _bfs() {
        fill(begin(d), end(d), -1);
        queue<int> que;
        for (int i = 0; i < n; i++) {
            if (!used[i]) {
                que.push(i);
                d[i] = 0;
            }
        }
        while (!que.empty()) {
            int i = que.front();
            que.pop();
            for (auto &e : es[i]) {
                int j = match[e];
                if (j != -1 && d[j] == -1) {
                    que.push(j);
                    d[j] = d[i] + 1;
                }
            }
        }
    }

    bool _dfs(int now) {
        used2[now] = true;
        for (auto &e : es[now]) {
            int u = match[e];
            if (u == -1 || (!used2[u] && d[u] == d[now] + 1 && _dfs(u))) {
                match[e] = now, used[now] = true;
                return true;
            }
        }
        return false;
    }

    int bipartite_matching() { // 右側の i は左側の match[i] とマッチングする
        fill(begin(match), end(match), -1), fill(begin(used), end(used), false);
        int ret = 0;
        while (true) {
            _bfs();
            fill(begin(used2), end(used2), false);
            int flow = 0;
            for (int i = 0; i < n; i++) {
                if (!used[i] && _dfs(i)) flow++;
            }
            if (flow == 0) break;
            ret += flow;
        }
        return ret;
    }
};

int main() {
    int H, W;
    cin >> H >> W;

    vector<string> S(H);
    rep(i, H) cin >> S[i];

    vector<int> ids;
    rep(i, H) {
        int cnt = 0;
        rep(j, W) {
            if (S[i][j] == '#') cnt++;
        }
        if (cnt == W) {
            cout << "No\n";
            return 0;
        }
        if (cnt > 0) ids.eb(i);
    }

    int K = sz(ids);
    rep(i, K) {
        if (ids[i] != H - K + i) {
            cout << "No\n";
            return 0;
        }
    }

    vector<int> dx = {0, 1, 0, -1}, dy = {1, 0, -1, 0};

    rep(t, 1 << (H + 1)) {
        if (__builtin_popcount(t) != K + 1) continue;

        vector<vector<int>> c(H, vector<int>(W, 0));
        int ptr = K - 1;
        rep3(i, H, 0) {
            if (flg(t, i)) {
                if (ptr == -1) break;
                int x = ids[ptr];
                rep(j, W) c[i - 1][j] = (S[x][j] == '#' ? 1 : 0);
                ptr--;
            } else {
                rep(j, W) c[i - 1][j] = 1;
            }
        }

        int A = 0;
        rep(i, H) rep(j, W) A += c[i][j];

        Bipartite_Matching BM(H * W, H * W);
        rep(i, H) {
            rep(j, W) {
                if ((i + j) % 2 == 1 || c[i][j] == 0) continue;
                rep(k, 4) {
                    int ni = i + dx[k], nj = j + dy[k];
                    if (ni >= 0 && ni < H && nj >= 0 && nj < W && c[ni][nj] == 1) {
                        int p = W * i + j, np = W * ni + nj;
                        BM.add_edge(p, np);
                    }
                }
            }
        }

        int B = BM.bipartite_matching();
        // rep(i, H) print(c[i]);
        // cout << A << ' ' << B << '\n';
        if (B * 2 != A) continue;

        vector<string> T(H, string(W, '.'));
        char tmp = 'a';
        rep(i, H * W) {
            if (BM.match[i] == -1) continue;
            int j = BM.match[i];
            T[i / W][i % W] = tmp;
            T[j / W][j % W] = tmp;
            if (tmp == 'z') {
                tmp = 'A';
            } else {
                tmp++;
            }
        }
        cout << "Yes\n";
        rep(i, H) cout << T[i] << '\n';
        return 0;
    }

    cout << "No\n";
}