1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<vector>
 7 #include<queue>
 8 #include<map>
 9 using std::cin;
10 using std::cout;
11 using std::endl;
12 using std::find;
13 using std::sort;
14 using std::pair;
15 using std::queue;
16 using std::vector;
17 #define pb(e) push_back(e)
18 #define sz(c) (int)(c).size()
19 #define mp(a, b) make_pair(a, b)
20 #define all(c) (c).begin(), (c).end()
21 #define iter(c) decltype((c).begin())
22 #define cls(arr,val) memset(arr,val,sizeof(arr))
23 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
24 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
25 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
26 const int N = 190;
27 typedef unsigned long long ull;
28 namespace work {
29     struct Node {
30         int x, y, s;
31         Node(int i = 0, int j = 0, int k = 0) :x(i), y(j), s(k) {}
32     };
33     bool map[N][N], vis[N][N];
34     const int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
35     int n, m, res[N][N];
36     inline int bfs(int x, int y) {
37         cls(vis, false);
38         queue<Node> que;
39         que.push(Node(x, y, 0));
40         vis[x][y] = true;
41         while (!que.empty()) {
42             Node t = que.front(); que.pop();
43             if (map[t.x][t.y]) return t.s;
44             rep(i, 4) {
45                 int nx = dx[i] + t.x, ny = dy[i] + t.y;
46                 if (nx < 0 || nx >= n || ny < 0 || ny >= m || vis[nx][ny]) continue;
47                 que.push(Node(nx, ny, t.s + 1));
48             }
49         }
50         return 0;
51     }
52     inline void solve() {
53         char buf[N];
54         while (~scanf("%d %d", &n, &m)) {
55             rep(i, n) {
56                 scanf("%s", buf);
57                 rep(j, m) map[i][j] = buf[j] - ‘0‘ & 1;
58             }
59             rep(i, n) {
60                 rep(j, m) res[i][j] = map[i][j] ? 0 : bfs(i, j);
61             }
62             rep(i, n) {
63                 rep(j, m) printf("%d%c", res[i][j], j < m - 1 ? ‘ ‘ : ‘\n‘);
64             }
65         }
66     }
67 }
68 int main() {
69 #ifdef LOCAL
70     freopen("in.txt", "r", stdin);
71     freopen("out.txt", "w+", stdout);
72 #endif
73     work::solve();
74     return 0;
75 }