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 JavaScript (node.js v5.12) (judge verdict: Accepted)

"use strict";

var main = function main(input) {
  var args = input.split('\n');
  var H = parseInt(args[0].split(' ')[0], 10);
  var W = parseInt(args[0].split(' ')[1], 10);
  var S = [];

  for (var i = 0; i < H; i++) {
    S.push(args[i + 1]);
  }

  var result = Array.from(new Array(H), function () {
    return new Array(W).fill(0);
  });

  for (var _i = 0; _i < S.length; _i++) {
    var line = S[_i];

    for (var j = 0; j < line.length; j++) {
      if (line.charAt(j) == '#') {
        result[_i][j] = '#'; // 上に波及、一番上の時(i == 0)はやらない

        if (_i != 0) {
          var up = S[_i - 1]; // 左に波及、一番左の時(j == 0)はやらない

          if (j != 0) {
            if (up.charAt(j - 1) != '#') {
              result[_i - 1][j - 1]++;
            }
          } // 右に波及、一番右の時(j == W - 1)はやらない


          if (j != W - 1) {
            if (up.charAt(j + 1) != '#') {
              result[_i - 1][j + 1]++;
            }
          } // 真ん中に波及


          if (up.charAt(j) != '#') {
            result[_i - 1][j]++;
          }
        } // 下に波及、一番下の時(i == H - 1)はやらない


        if (_i != H - 1) {
          var down = S[_i + 1]; // 左に波及、一番左の時(j == 0)はやらない

          if (j != 0) {
            if (down.charAt(j - 1) != '#') {
              result[_i + 1][j - 1]++;
            }
          } // 右に波及、一番右の時(j == W - 1)はやらない


          if (j != W - 1) {
            if (down.charAt(j + 1) != '#') {
              result[_i + 1][j + 1]++;
            }
          } // 真ん中に波及


          if (down.charAt(j) != '#') {
            result[_i + 1][j]++;
          }
        } // 左右に波及
        // 左に波及、一番左の時(j == 0)はやらない


        if (j != 0) {
          if (line.charAt(j - 1) != '#') {
            result[_i][j - 1]++;
          }
        } // 右に波及、一番右の時(j == W - 1)はやらない


        if (j != W - 1) {
          if (line.charAt(j + 1) != '#') {
            result[_i][j + 1]++;
          }
        }
      }
    }
  }

  result.forEach(function (elem) {
    return console.log(elem.join(''));
  });
};

main(require('fs').readFileSync('/dev/stdin', 'utf-8'));