Problem:
Score : 200 points

Problem Statement

You are given an H × W grid.

The squares in the grid are described by H strings, S_1,...,S_H.

The j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \leq i \leq H,1 \leq j \leq W).

. stands for an empty square, and # stands for a square containing a bomb.

Dolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.

(Below, we will simply say "adjacent" for this meaning. For each square, there are at most eight adjacent squares.)

He decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.

Print the strings after the process.

Constraints

1 \leq H,W \leq 50

S_i is a string of length W consisting of # and ..

Input

Input is given from Standard Input in the following format:

H W
S_1
:
S_H

Output

Print the H strings after the process.

The i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \leq i \leq H, 1 \leq j \leq W).

Sample Input 1

3 5
.....
.#.#.
.....

Sample Output 1

11211
1#2#1
11211

For example, let us observe the empty square at the first row from the top and first column from the left.

There is one bomb square adjacent to this empty square: the square at the second row and second column.

Thus, the . corresponding to this empty square is replaced with 1.

Sample Input 2

3 5
#####
#####
#####

Sample Output 2

#####
#####
#####

It is possible that there is no empty square.

Sample Input 3

6 6
#####.
#.#.##
####.#
.#..#.
#.##..
#.#...

Sample Output 3

#####3
#8#7##
####5#
4#65#2
#5##21
#4#310

Solution in Pascal (FPC 2.6.2) (judge verdict: Accepted)

var
        n,m,i,j:longint;
        g:array[0..101,0..101]of char;
        f:array[0..101,0..101]of longint;
begin
        readln(n,m);
        for i:=1 to n do
        begin
                for j:=1 to m do
                read(g[i,j]);
                readln;
        end;
        for i:=1 to n do
        for j:=1 to m do
        if g[i,j]<>'#' then
        begin
                if g[i-1,j-1]='#' then inc(f[i,j]);
                if g[i-1,j]='#' then inc(f[i,j]);
                if g[i-1,j+1]='#' then inc(f[i,j]);
                if g[i,j-1]='#' then inc(f[i,j]);
                if g[i,j+1]='#' then inc(f[i,j]);
                if g[i+1,j-1]='#' then inc(f[i,j]);
                if g[i+1,j]='#' then inc(f[i,j]);
                if g[i+1,j+1]='#' then inc(f[i,j]);
        end;
        for i:=1 to n do
        begin
                for j:=1 to m do
                if g[i,j]<>'#' then write(f[i,j])
                else write('#');
                writeln;
        end;
end.