Imagine that you play a simplified version of Sudoku on the 4x4 field. In this version, you need to fill empty cells with numbers from 1 to 4 so that in each line, each column and in each of the four squares of 2x2, each number was found only once. You are given a partially filled field of Sudoku. Write a program that will check whether the proposed number is an acceptable course for a certain cell.
Input format
First, 4 lines are introduced, which are the current state of the field of Sudoku. Each line contains 4 characters: numbers from 1 to 4 or symbol '.' (Point), denoting an empty cage.
row color is introduced num . & nbsp; row & nbsp; and & nbsp; color & nbsp;- these are the coordinates of the cell for which you want to verify the permissibility of the course (numbering begins with 0). & Nbsp; num is the number that you want to place in this cell
Output format
take "Yes" if the proposed move is permissible (that is, the number & nbsp; num & nbsp; cage & nbsp; (row, color) without violation of the rules of Sudoku). Otherwise, withdraw "No". The conclusion should be sorted DIV>
Example
Input
1.34
.41.
3..1
42.3
1 1 2
Hint
There will be no clue here, decide for yourself!