## Goal

You are in a maze. You have to find the minimum number of moves to reach each cell from the starting point, and output those numbers in the initial maze.

The number of moves is represented using a character: 0-9 then A-Z (A=10, B=11, ... Z=35).

You may move from a cell to a neighbouring cell which is not a wall in any one of the four directions: left, right, up or down. The maze is periodic: if you go left you appear on the right if there is no wall, and vice versa, similarly with up/down.

There may be unreachable points.

The input maze is made of # for walls, . for free spaces and S for the starting position.

The output must be made of # for walls, . for unreachable points, and numbers 0-9, A-Z.
Input

**First line:** two space-separated integers `w` and `h`, the width and height of the maze.

`h` following lines: the maze.

Output

`h` lines: the maze with numbers for the reachable points.

Constraints

3 ≤ `w`, `h` ≤ 30

There are no more than 35 moves needed to reach a point.

Example

Input

10 5
##########
#S.......#
##.#####.#
##.#.....#
##########

Output

##########
#01234567#
##2#####8#
##3#DCBA9#
##########