#include <bits/stdc++.h>
using namespace std;
void printprecise(double l, long long int precision) {
  std::cout << std::fixed;
  std::cout << std::setprecision(precision);
  std::cout << l;
}
long long int modular(long long int x, long long int n, long long int m) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return modular((x * x) % m, n / 2, m);
  else
    return (x * modular((x * x) % m, (n - 1) / 2, m)) % m;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void initialize(long long int ar[], long long int n) {
  for (long long int x = 0; x < n; x++) ar[x] = x;
}
void printarray(long long int ar[], long long int n) {
  for (long long int x = 0; x < n; x++) cout << ar[x] << " ";
  cout << endl;
}
void printvector(vector<long long int> v) {
  for (long long int x = 0; x < v.size(); x++) {
    cout << v[x] << " ";
  }
  cout << endl;
}
long long int root(long long int i, long long int ar[]) {
  while (ar[i] != i) {
    ar[i] = ar[ar[i]];
    i = ar[i];
  }
  return i;
}
void unione(long long int a, long long int b, long long int ar[]) {
  long long int p = root(a, ar);
  long long int q = root(b, ar);
  ar[p] = ar[q];
}
void bfs(long long int n, long long int vis[], long long int level[],
         vector<long long int> v[]) {
  list<long long int> g;
  g.push_back(n);
  vis[n] = 1;
  level[n] = 0;
  while (!g.empty()) {
    long long int a = g.front();
    g.pop_front();
    for (long long int x = 0; x < v[a].size(); x++) {
      if (vis[v[a][x]] == 0) {
        g.push_back(v[a][x]);
        vis[v[a][x]] = 1;
        level[v[a][x]] = level[a] + 1;
      }
    }
  }
}
bool dfs(long long int n, vector<long long int> v[], long long int vis[],
         long long int parent) {
  vis[n] = 1;
  for (long long int x = 0; x < v[n].size(); x++) {
    if (vis[v[n][x]] == 0) {
      return dfs(v[n][x], v, vis, n);
    } else {
      if (v[n][x] != parent) return true;
    }
  }
  return false;
}
void computelpsarray(string s, long long int lps[]) {
  long long int i = 1;
  long long int j = 0;
  lps[0] = 0;
  while (i < s.length()) {
    if (s[i] == s[j]) {
      lps[i] = j + 1;
      i++;
      j++;
    } else {
      if (j == 0) {
        lps[i] = 0;
        i++;
      } else {
        j = lps[j - 1];
      }
    }
  }
}
void getZarr(string str, long long int Z[]) {
  long long int n = str.length();
  long long int L, R, k;
  L = R = 0;
  Z[0] = 0;
  for (long long int i = 1; i < n; ++i) {
    if (i > R) {
      L = R = i;
      while (R < n && str[R - L] == str[R]) R++;
      Z[i] = R - L;
      R--;
    } else {
      k = i - L;
      if (Z[k] < R - i + 1)
        Z[i] = Z[k];
      else {
        L = i;
        while (R < n && str[R - L] == str[R]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  }
}
int myXOR(int x, int y) { return (x | y) & (~x | ~y); }
long long int nCr(long long int n, long long int r) {
  if (r == 0 || n == r) {
    return 1;
  }
  return nCr(n - 1, r) + nCr(n - 1, r - 1);
}
bool isValid(long long int x, long long int y, long long int n,
             long long int m) {
  if (x < n && x >= 0 && y < m && y >= 0) {
    return true;
  }
  return false;
}
char g[1000][1000];
long long int vis[1000][1000];
long long int dfs_t(long long int x, long long int y, long long int val,
                    long long int n, long long int m) {
  vis[x][y] = val;
  long long int r = 1;
  if (isValid(x + 1, y, n, m) && g[x + 1][y] == '.' && vis[x + 1][y] == 0) {
    r = r + dfs_t(x + 1, y, val, n, m);
  }
  if (isValid(x - 1, y, n, m) && g[x - 1][y] == '.' && vis[x - 1][y] == 0) {
    r = r + dfs_t(x - 1, y, val, n, m);
  }
  if (isValid(x, y + 1, n, m) && g[x][y + 1] == '.' && vis[x][y + 1] == 0) {
    r = r + dfs_t(x, y + 1, val, n, m);
  }
  if (isValid(x, y - 1, n, m) && g[x][y - 1] == '.' && vis[x][y - 1] == 0) {
    r = r + dfs_t(x, y - 1, val, n, m);
  }
  return r;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  for (long long int x = 0; x < n; x++) {
    for (long long int y = 0; y < m; y++) {
      cin >> g[x][y];
    }
  }
  memset(vis, 0, sizeof(vis));
  long long int val = 1;
  long long int count[1000001] = {0};
  for (long long int x = 0; x < n; x++) {
    for (long long int y = 0; y < m; y++) {
      if (g[x][y] == '.' && vis[x][y] == 0) {
        long long int r = dfs_t(x, y, val, n, m);
        count[val] = r;
        val++;
      }
    }
  }
  for (long long int x = 0; x < n; x++) {
    for (long long int y = 0; y < m; y++) {
      if (g[x][y] == '*') {
        set<long long int> s;
        if (isValid(x + 1, y, n, m) && g[x + 1][y] == '.') {
          s.insert(vis[x + 1][y]);
        }
        if (isValid(x - 1, y, n, m) && g[x - 1][y] == '.') {
          s.insert(vis[x - 1][y]);
        }
        if (isValid(x, y + 1, n, m) && g[x][y + 1] == '.') {
          s.insert(vis[x][y + 1]);
        }
        if (isValid(x, y - 1, n, m) && g[x][y - 1] == '.') {
          s.insert(vis[x][y - 1]);
        }
        long long int ans = 1;
        for (auto i : s) {
          ans += count[i];
        }
        cout << ans % 10;
      } else {
        cout << '.';
      }
    }
    cout << endl;
  }
}
