#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

struct HopcroftKarp {
  std::vector<int> match;

  HopcroftKarp(int left, int right) : left(left), graph(left), match(left + right, -1), level(left), used(left, -1) {}

  void add_edge(int u, int v) { graph[u].emplace_back(left + v); }

  int solve() {
    int res = 0;
    while (true) {
      bfs();
      int tmp = 0;
      for (int i = 0; i < left; ++i) {
        if (match[i] == -1) {
          if (dfs(i)) ++tmp;
          ++timestamp;
        }
      }
      if (tmp == 0) return res;
      res += tmp;
    }
  }

private:
  int left, timestamp = 0;
  std::vector<std::vector<int>> graph;
  std::vector<int> level, used;

  void bfs() {
    std::fill(level.begin(), level.end(), -1);
    std::queue<int> que;
    for (int i = 0; i < left; ++i) {
      if (match[i] == -1) {
        que.emplace(i);
        level[i] = 0;
      }
    }
    while (!que.empty()) {
      int ver = que.front(); que.pop();
      for (int e : graph[ver]) {
        if (match[e] != -1 && level[match[e]] == -1) {
          level[match[e]] = level[ver] + 1;
          que.emplace(match[e]);
        }
      }
    }
  }

  bool dfs(int ver) {
    used[ver] = timestamp;
    for (int e : graph[ver]) {
      int tmp = match[e];
      if (tmp == -1 || (used[tmp] < timestamp && level[tmp] == level[ver] + 1 && dfs(tmp))) {
        used[ver] = timestamp;
        match[e] = ver;
        match[ver] = e;
        return true;
      }
    }
    return false;
  }
};

int main() {
  vector<char> ch;
  REP(i, 26) ch.emplace_back('a' + i);
  REP(i, 26) ch.emplace_back('A' + i);

  int h, w; cin >> h >> w;
  vector<string> s(h); REP(i, h) cin >> s[i];
  REP(i, h) {
    if (count(ALL(s[i]), '#') == w || (i + 1 < h && count(ALL(s[i]), '#') > 0 && count(ALL(s[i + 1]), '#') == 0)) {
      cout << "No\n";
      return 0;
    }
  }
  int ub = h;
  while (ub > 0 && count(ALL(s[ub - 1]), '#') > 0) --ub;
  int y = h - ub;
  REP(b, 1 << h) {
    if (__builtin_popcount(b) + y > h) continue;
    vector<string> t(h, string(w, '.'));
    for (int i = h - 1, j = h - 1; i >= 0; --i) {
      if (b >> i & 1) {
        t[i] = string(w, '#');
      } else if (j >= ub) {
        t[i] = s[j--];
      }
    }
    vector id(h, vector(w, -1));
    int num[2] = {};
    REP(i, h) REP(j, w) {
      if (t[i][j] == '#') id[i][j] = num[(i + j) & 1]++;
    }
    if (num[0] != num[1]) continue;
    HopcroftKarp hk(num[0], num[1]);
    REP(i, h) REP(j, w) {
      if ((i + j) % 2 == 1 || id[i][j] == -1) continue;
      REP(k, 4) {
        int r = i + dy[k], c = j + dx[k];
        if (0 <= r && r < h && 0 <= c && c < w && id[r][c] != -1) hk.add_edge(id[i][j], id[r][c]);
      }
    }
    if (hk.solve() < num[0]) continue;
    int ch_idx = 0;
    REP(i, h) REP(j, w) {
      if ((i + j) % 2 == 1 || id[i][j] == -1) continue;
      REP(k, 4) {
        int r = i + dy[k], c = j + dx[k];
        if (0 <= r && r < h && 0 <= c && c < w && id[r][c] != -1 && hk.match[id[i][j]] - num[0] == id[r][c]) {
          t[i][j] = t[r][c] = ch[ch_idx++];
        }
      }
    }
    cout << "Yes\n";
    REP(i, h) cout << t[i] << '\n';
    return 0;
  }
  cout << "No\n";
  return 0;
}