In this problem you will need to deal with an n \times m grid graph. The graph's vertices are the nodes of the n \times m grid. The graph's edges are all the sides and diagonals of the grid's unit squares.

The figure below shows a 3 \times 5 graph. The black lines are the graph's edges, the colored circles are the graph's vertices. The vertices of the graph are painted on the picture for a reason: the coloring is a correct vertex coloring of the 3 \times 5 graph into four colors. A graph coloring is correct if and only if each vertex is painted and no two vertices connected by an edge are painted the same color.

You are given the size of the grid graph n \times m and the colors of some of its vertices. Find any way how to paint the unpainted vertices of the graph in 4 colors to make the final coloring a correct vertex graph coloring. If there is no such correct vertex coloring, say that the answer doesn't exist.

The first line contains two integers n and m (2 \le n,m \le 1000). Each of the next n lines consists of m characters - the given graph. Each character is either «0», «1», «2», «3», «4». Character «0» means that the corresponding vertex is unpainted, otherwise the character means the color of the vertex.

Assume that all the available colors are numbered from 1 to 4.

If there is no way to get correct vertex coloring of the graph, print 0 in a single line. Otherwise print the colored n \times m graph. Print the graph in the same format as in the input.

If multiple answers exist, print any of them.

The answer to the first sample is shown on the picture (1 - green color, 2 - blue, 3 - dark blue, 4 - pink).

In the second sample there exists 4! answers, each of them is considered correct.

In the third sample two vertices with equal colors are connected. So the correct vertex coloring couldn't be obtained.