背景



你玩儿过扫雷游戏吧？有个操作系统中带了这个小游戏，那个系统叫什么来着？ -)在游戏中要想过关，就必须要在一个 NxM 的区域上找出所有的地雷。游戏过程中，计算机会在地图上显示一些数字从而帮助你确定哪里有地雷。例如，在下面这个有两颗地雷的 4x4 的地图（*表示地雷）：

*...

....

.*..

....





根据上面的地图，可以计算出应该提供给游戏者的数字如下所示：

*100

2210

1*10

1110





每个数字表示了该方格周围到底有几个地雷，当然，一个方格周围最多的时候只会有八个。



输入



输入中将包括一系列的地图，每个地图的第一行有两个整数 n 和 m（0 <n,m < 100），它们表示了地图的行数和列数。下面的 n 行每行都有 m 个字符，其中 . 表示安全而 * 表示地雷。如果地图的 n 和 m 都为 0，则表示输入结束。



输出



针对每一个地图，首先输出一行：

Field #x:



其中 x 是当前地图的编号（从 1 开始）。下面的 n 行则将地图中的 . 以数字表示，该数字表示该方格周围有多少颗地雷。

-background

Have you ever played a game of mine? There is an operating system with this little game, the system is called what? In order to pass the game, it is necessary to find all the mines in a NxM area. In the course of the game, the computer will display a number of numbers on the map to help you determine where there is a mine. For example, in the following map of the 4x4 with two mines (* said mine):

*...

....

.*..

....

According to the map above, can be calculated should be provided to the player s number is shown as follows:

*100

Two thousand two hundred and ten

1*10

One thousand one hundred and ten

Each figure indicates that there are several mines around the box, of course, there is only one square around the time there will be eight.

input

The input will consist of a series of maps, each map of the first line contains two integers n and m (0 <n, m 100), they said the map of the number of rows and columns. Each of the following N lines with M characters, incl