Codah ClubTrain. Submit. Improve.
Sign in
English
#0002E8

Mines

You want to solve a version of the Minesweeper game.

You are given a m by n matrix where each element represents the number of mines around that field (on the 8 adjacent fields, and not including itself)

You have to output one valid configuration of the mines.



InputThe first line will contain two numbers M and N both less or equal than 100. The following M lines will contain N digits (0-8) representing the number of mines around that field


OutputTo the standard output write M lines of N characters each. representing the configuration (0 for empty fields and 1 for mines)


Input:
2 2
11
10
Output:
00
01


Input:
2 2
22
11
Output:
00
11


Note: a solution will always exist

Submit solution

Coming later

The grading service will be connected in a later migration step. You can inspect the task and your previous results now.