Solve Sudoku

You are given a 9x9 Sudoku board with zeros representing empty cells. Your task is to fill the empty cells so that each row, each column, and each of the 3x3 sub-boxes contains the digits 1 through 9 exactly once. If the board is unsolvable, print False. Otherwise, print the completed board.

The board is provided via standard input and the solution should be printed on standard output. The input consists of 9 lines, each containing 9 space-separated integers. The output should contain 9 lines; if the sudoku is solved, each line displays 9 space-separated numbers representing the solved row, otherwise the output is a single line with False.

inputFormat

The input consists of 9 lines. Each line contains 9 space-separated integers representing a row of the Sudoku board. The number 0 represents an empty cell.

outputFormat

If a valid solution exists, output the solved Sudoku board in exactly 9 lines with 9 space-separated integers on each line. Otherwise, output a single line containing False.

5 3 0 0 7 0 0 0 0
6 0 0 1 9 5 0 0 0
0 9 8 0 0 0 0 6 0
8 0 0 0 6 0 0 0 3
4 0 0 8 0 3 0 0 1
7 0 0 0 2 0 0 0 6
0 6 0 0 0 0 2 8 0
0 0 0 4 1 9 0 0 5
0 0 0 0 8 0 0 7 9

5 3 4 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
1 9 8 3 4 2 5 6 7
8 5 9 7 6 1 4 2 3
4 2 6 8 5 3 7 9 1
7 1 3 9 2 4 8 5 6
9 6 1 5 3 7 2 8 4
2 8 7 4 1 9 6 3 5
3 4 5 2 8 6 1 7 9