#include <bits/stdc++.h>
using namespace std;
char s[1010][1010];
int a[1010][1010];
bool v[15];
int n, m, tot;
void bfs(int x, int y, int c) {
  memset(v, 0, sizeof(v));
  vector<int> qx, qy;
  qx.clear();
  qy.clear();
  a[x][y] = -c;
  qx.push_back(x);
  qy.push_back(y);
  int h = 0;
  while (h < qx.size()) {
    x = qx[h];
    y = qy[h++];
    for (int i = -1; i < 2; ++i)
      for (int j = -1; j < 2; ++j)
        if (abs(i) + abs(j) == 1) {
          int k = x + i, t = y + j;
          if (k >= 0 && k < n && t >= 0 && t < m) {
            if (a[k][t] == c) {
              qx.push_back(k);
              qy.push_back(t);
              a[k][t] = -c;
            } else if (a[k][t] < 11 && a[k][t] > 0)
              v[a[k][t]] = 1;
          }
        }
  }
  int o = 1;
  for (; o <= 10 && v[o]; ++o)
    ;
  for (int p = 0; p < qx.size(); ++p) a[qx[p]][qy[p]] = o;
  return;
}
int main() {
  scanf("%d%d\n", &n, &m);
  for (int i = 0; i < n; ++i) gets(s[i]);
  memset(a, 0, sizeof(a));
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
      if (s[i][j] == '.' && !a[i][j])
        if (j + 1 < m && s[i][j + 1] == '.') a[i][j] = a[i][j + 1] = ++tot;
  for (int j = 0; j < m; ++j)
    for (int i = 0; i < n; ++i)
      if (s[i][j] == '.' && !a[i][j]) {
        if (i + 1 < n && s[i + 1][j] == '.')
          if (a[i + 1][j])
            a[i][j] = a[i + 1][j];
          else
            a[i][j] = a[i + 1][j] = ++tot;
        else if (i && s[i - 1][j] == '.')
          a[i][j] = a[i - 1][j];
      }
  bool f = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
      if (s[i][j] == '.' && !a[i][j])
        if (j && s[i][j - 1] == '.')
          a[i][j] = a[i][j - 1];
        else
          f = 1;
  if (f)
    printf("-1\n");
  else {
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j)
        if (a[i][j] > 10) bfs(i, j, a[i][j]);
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j)
        if (!a[i][j])
          printf("#");
        else
          printf("%d", a[i][j] - 1);
      printf("\n");
    }
  }
  return 0;
}
