#include <bits/stdc++.h>
using namespace std;
int A[1010][1010];
bool F(int q, int w) {
  if (A[q - 1][w] == 0) return false;
  if (A[q + 1][w] == 0) return false;
  if (A[q][w - 1] == 0) return false;
  if (A[q][w + 1] == 0) return false;
  return true;
}
void G(int q, int w) {
  if ((A[q - 1][w] == 0) && F(q - 1, w)) A[q - 1][w] = 111;
  if ((A[q + 1][w] == 0) && F(q + 1, w)) A[q + 1][w] = 111;
  if ((A[q][w - 1] == 0) && F(q, w - 1)) A[q][w - 1] = 111;
  if ((A[q][w + 1] == 0) && F(q, w + 1)) A[q][w + 1] = 111;
}
int V[15];
void T(int x, int y) {
  int q = A[x][y];
  int i, j, k;
  memset(V, 0, sizeof(V));
  for (i = max(1, x - 3); i < x + 3; i++)
    for (j = max(1, y - 3); j < y + 3; j++)
      if (A[i][j] == 111) {
        if (A[i][j - 1] <= 11) V[A[i][j - 1]] = 1;
        if (A[i][j + 1] <= 11) V[A[i][j + 1]] = 1;
        if (A[i - 1][j] <= 11) V[A[i - 1][j]] = 1;
        if (A[i + 1][j] <= 11) V[A[i + 1][j]] = 1;
      }
  for (k = 2; k < 12; k++)
    if (V[k] == 0) break;
  for (i = max(1, x - 3); i < x + 3; i++)
    for (j = max(1, y - 3); j < y + 3; j++)
      if (A[i][j] == 111) A[i][j] = k;
}
int main() {
  int i, m, n, j;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n + 5; i++)
    for (j = 0; j < m + 5; j++) A[i][j] = 1;
  char ch;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) {
      do {
        scanf("%c", &ch);
      } while ((ch != '.') && (ch != '#'));
      if (ch == '.') A[i + 1][j + 1] = 0;
    }
  int x, y;
  for (x = 0; x < n + 2; x++)
    for (y = 0; y < m + 2; y++)
      if (A[x][y] == 0) {
        A[x][y] = 111;
        if (F(x, y)) {
          printf("-1\n");
          return 0;
        }
        if (A[x + 1][y] != 0) {
          A[x][y + 1] = 111;
          G(x, y);
          G(x, y + 1);
        } else {
          A[x + 1][y] = 111;
          G(x, y);
          G(x + 1, y);
        }
        T(x, y);
      }
  for (i = 1; i < n + 1; i++) {
    for (j = 1; j < m + 1; j++) {
      if (A[i][j] == 1)
        printf("#");
      else
        printf("%d", A[i][j] % 10);
    }
    printf("\n");
  }
  return 0;
}
