A well known puzzle consists of \textbf{7} hexagonal pieces, each with the numbers \textbf{1} through \textbf{6} printed on the sides. Each piece has a different arrangement of the numbers on its sides, and the object is to place the \textbf{7} pieces in the arrangement shown below such that the numbers on each shared edge of the arrangement are identical. Figure (a) is an example of one solution: Rotating any solution also gives another trivially identical solution. To avoid this redundancy, we will only deal with solutions which have a \textbf{1} on the uppermost edge of the central piece, as in the example. \InputFile The first line will contain a single integer indicating the number of test cases. Each case will consist of a single line containing \textbf{42} integers. The first \textbf{6} represent the values on piece \textbf{0} listed in clockwise order; the second \textbf{6 }represent the values on piece \textbf{1}, and so on. \OutputFile For each test case, output the case number (using the format shown below) followed by either the phrase \textbf{No solution }or by a solution specification. A solution specification lists the piece numbers in the order shown in the Position Notation of Figure (b). Thus if piece \textbf{3} is in the center, a \textbf{3} is printed first; if piece \textbf{0} is at the top, \textbf{0} is printed second, and so on. Each test case is guaranteed to have at most one solution.