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 Fortran (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program bomb
  implicit none
  integer :: h, w, i, c, j
  character(len=50), allocatable :: s(:), ans(:)
  
  read(*,*) h, w
  allocate(s(h),ans(h))
  do i = 1, h
     read(*,*) s(i)
  end do

  do i = 1, h
     do j = 1, w
        call bombcount(s, i, j, h, w, ans)
     end do
  end do

  do i = 1, h
     write(*,'(a)') ans(i)
  end do


  stop
contains
  subroutine bombcount(s,i,j,h,w,ans)
    implicit none
    character(len=50) :: s(h), ans(h)
    integer :: i,j,h,w
    integer :: a, b, c, d, e, f, g

    if (s(i)(j:j) == '#' ) then
       write(ans(i)(j:j),'(a)') '#'
       return
    end if
    
    c = 0
    do a = j-1, j+1
       if (i == 1) then
          exit
       else if (a == 0) then
          cycle
       else if ( a == w+1 ) then
          cycle
       else
          if (s(i-1)(a:a) == '#' ) then
             c = c + 1
          end if
       end if
    end do

    if ( j /= 1 ) then
       if (s(i)(j-1:j-1) == '#' ) then
          c = c + 1
       end if
    end if
    
    if ( j /= w ) then
       if (s(i)(j+1:j+1) == '#' ) then
          c = c + 1 
       end if
    end if
    
    do a = j-1, j+1
       if (i== h) then
          exit
       else if (a == 0) then
          cycle
       else if ( a == w+1 ) then
          cycle
       else
          if (s(i+1)(a:a) == '#' ) then
             c = c + 1
          end if
       end if
    end do

    write(ans(i)(j:j),'(i1)') c
    
    return
  end subroutine bombcount
end program bomb