Problem: Physicist Woll likes to play one relaxing game in between his search of the theory of everything.

Game interface consists of a rectangular n × m playing field and a dashboard. Initially some cells of the playing field are filled while others are empty. Dashboard contains images of all various connected (we mean connectivity by side) figures of 2, 3, 4 and 5 cells, with all their rotations and reflections. Player can copy any figure from the dashboard and place it anywhere at the still empty cells of the playing field. Of course any figure can be used as many times as needed.

Woll's aim is to fill the whole field in such a way that there are no empty cells left, and also... just have some fun.

Every initially empty cell should be filled with exactly one cell of some figure. Every figure should be entirely inside the board.

<image>

In the picture black cells stand for initially filled cells of the field, and one-colour regions represent the figures.

Input

First line contains integers n and m (1 ≤ n, m ≤ 1000) — the height and the width of the field correspondingly. Next n lines contain m symbols each. They represent the field in a natural way: j-th character of the i-th line is "#" if the corresponding cell is filled, and "." if it is empty.

Output

If there is no chance to win the game output the only number "-1" (without the quotes). Otherwise output any filling of the field by the figures in the following format: each figure should be represented by some digit and figures that touch each other by side should be represented by distinct digits. Every initially filled cell should be represented by "#".

Examples

Input

2 3
...
#.#


Output

000
#0#


Input

3 3
.#.
...
..#


Output

5#1
511
55#


Input

3 3
...
.##
.#.


Output

-1


Input

1 2
##


Output

##

Note

In the third sample, there is no way to fill a cell with no empty neighbours.

In the forth sample, Woll does not have to fill anything, so we should output the field from the input.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
struct point {
  point(int r, int c) : r(r), c(c) {}
  int r, c;
};
inline bool operator==(const point& p1, const point& p2) {
  return p1.r == p2.r && p1.c == p2.c;
}
inline bool operator!=(const point& p1, const point& p2) {
  return p1.r != p2.r || p1.c != p2.c;
}
const int NMAX = 1000, ASIZE = 10, dR[] = {-1, 0, 1, 0}, dC[] = {0, -1, 0, 1};
int N, M;
char T[NMAX][NMAX + 1];
inline bool in_bounds(const point& p) {
  return p.r >= 0 && p.r < N && p.c >= 0 && p.c < M;
}
inline bool lonely(const point& p, const point& prev) {
  if (T[p.r][p.c] != '.') return false;
  for (int i = 0, _n = (4); i < _n; ++i) {
    point adj(p.r + dR[i], p.c + dC[i]);
    if (adj != prev && in_bounds(adj) && T[adj.r][adj.c] == '.') return false;
  }
  return true;
}
void process(const vector<point>& points) {
  static bool used[ASIZE];
  fill_n(used, ASIZE, false);
  for (int i = 0, _n = (points.size()); i < _n; ++i)
    for (int dir = 0, _n = (4); dir < _n; ++dir) {
      point adj(points[i].r + dR[dir], points[i].c + dC[dir]);
      if (!in_bounds(adj) || !isdigit(T[adj.r][adj.c])) continue;
      bool ok = true;
      for (int j = 0, _n = (points.size()); j < _n; ++j)
        if (adj == points[j]) ok = false;
      if (ok) used[T[adj.r][adj.c] - '0'] = true;
    }
  int col = -1;
  for (int i = 0, _n = (ASIZE); i < _n; ++i)
    if (!used[i]) col = i;
  for (int i = 0, _n = (points.size()); i < _n; ++i)
    T[points[i].r][points[i].c] = col + '0';
}
int main() {
  scanf("%d%d", &N, &M);
  for (int i = 0, _n = (N); i < _n; ++i) scanf("%s", T[i]);
  for (int r = 0, _n = (N); r < _n; ++r)
    for (int c = 0, _n = (M); c < _n; ++c)
      if (T[r][c] == '.') {
        static vector<point> tab;
        tab.clear();
        point p1(r, c);
        tab.push_back(p1);
        if (c + 1 < M && T[r][c + 1] == '.') {
          point p2(r, c + 1);
          tab.push_back(p2);
          if (c + 2 < M && lonely(point(r, c + 2), p2))
            tab.push_back(point(r, c + 2));
          if (r + 1 < N && lonely(point(r + 1, c), p1))
            tab.push_back(point(r + 1, c));
          if (r + 1 < N && lonely(point(r + 1, c + 1), p2))
            tab.push_back(point(r + 1, c + 1));
          process(tab);
        } else if (r + 1 < N && T[r + 1][c] == '.') {
          point p2(r + 1, c);
          tab.push_back(p2);
          if (c + 1 < M && lonely(point(r + 1, c + 1), p2))
            tab.push_back(point(r + 1, c + 1));
          if (r + 2 < N && lonely(point(r + 2, c), p2))
            tab.push_back(point(r + 2, c));
          if (c - 1 >= 0 && lonely(point(r + 1, c - 1), p2))
            tab.push_back(point(r + 1, c - 1));
          process(tab);
        } else {
          printf("%d\n", -1);
          return 0;
        }
      }
  for (int i = 0, _n = (N); i < _n; ++i) printf("%s\n", T[i]);
}