import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


class BMatch {
  int n;
  int[][] g;
  int[] to;
  bool[] vis;
  this(int n) {
    this.n = n; g = new int[][n]; to = new int[n]; vis = new bool[n];
  }
  void addEdge(int u, int v) {
    g[u] ~= v; g[v] ~= u;
  }
  bool augment(int u) {
    foreach (v; g[u]) if (!vis[v]) {
      vis[v] = true;
      if (to[v] == -1 || augment(to[v])) {
        to[u] = v; to[v] = u; return true;
      }
    }
    return false;
  }
  int solve() {
    int ret;
    to[] = -1;
    foreach (u; 0 .. n) if (to[u] == -1) {
      vis[] = false;
      if (augment(u)) ++ret;
    }
    return ret;
  }
}


int H, W;
string[] S;

bool solve() {
  int mx0 = -1, mn1 = H;
  foreach (x; 0 .. H) {
    if (S[x].count('#') == 0) {
      chmax(mx0, x);
    } else {
      chmin(mn1, x);
    }
  }
  if (!(mx0 < mn1)) {
    return false;
  }
  foreach (p; 0 .. 1 << H) {
    if (popcnt(p) == H - mn1) {
      const sup = ((1 << H) - 1) ^ p;
      for (int q = sup; ; --q &= sup) {
        auto board = new char[][](H, W);
        int pos = mn1;
        foreach (x; 0 .. H) {
          if (p & 1 << x) {
            board[x][] = S[pos++][];
          } else if (q & 1 << x) {
            board[x][] = '#';
          } else {
            board[x][] = '.';
          }
        }
        auto bm = new BMatch(H * W);
        int cnt;
        foreach (x; 0 .. H) foreach (y; 0 .. W) {
          if (board[x][y] == '#') {
            ++cnt;
            if (x > 0 && board[x - 1][y] == '#') {
              bm.addEdge((x - 1) * W + y, x * W + y);
            }
            if (y > 0 && board[x][y - 1] == '#') {
              bm.addEdge(x * W + (y - 1), x * W + y);
            }
          }
        }
        const res = bm.solve;
        if (cnt == 2 * res) {
          auto ans = new char[][](H, W);
          foreach (x; 0 .. H) {
            ans[x][] = '.';
          }
          int id;
          foreach (x; 0 .. H) foreach (y; 0 .. W) {
            if (board[x][y] == '#') {
              if (ans[x][y] == '.') {
                const v = bm.to[x * W + y];
                ans[x][y] = ans[v / W][v % W] = cast(char)((id < 26) ? ('A' + id) : ('a' + (id - 26)));
                ++id;
              }
            }
          }
          writeln("Yes");
          foreach (x; 0 .. H) {
            writeln(ans[x]);
          }
          return true;
        }
        if (!q) break;
      }
    }
  }
  return false;
}

void main() {
  try {
    for (; ; ) {
      H = readInt();
      W = readInt();
      S = new string[H];
      foreach (x; 0 .. H) {
        S[x] = readToken();
      }
      
      const res = solve();
      if (!res) {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}