Sudoku is the Japanese reading of the characters 數獨, and it is also the name of a Japanese puzzle that is well known in the United States. In sudoku you fill a 9x9 grid with numbers so that all three conditions below hold.
Namgyu is hooked on sudoku and solves puzzles all day, but he cannot easily tell whether a board he just finished is really a correct answer. Write a program for him that decides whether a completely filled sudoku board is a correct solution.
The first line contains the number of test cases. The number of test cases is at most 100.
Each test case consists of nine lines, and each line holds nine integers separated by spaces. Every integer is between 1 and 9. One blank line sits between two consecutive test cases.
For each test case print Case x:, then one space, then CORRECT if the solution is valid and INCORRECT if it is not. Here x is the test case number, counting from 1.