QR Codes (the smallest, which is $21$ pixels by $21$ pixels, is shown below) are square arrays of black or white pixels (modules) which include Position Detection Patterns (the square bull's-eye patterns), Timing Patterns (the alternating black and white lines), Alignment Patterns in larger QR Codes , Format Information (the stippled pixels), Version information in larger QR Codes and Data and Error Correction Codewords (gray 8 pixel blocks). \includegraphics{https://static.e-olymp.com/content/48/48ca92912e01366efad154caeddbd44265e764c7.jpg} The $21$-by-$21$ QR Code has $26$ data and error correction codewords. At the lowest error correction level for this code, $19$ are data codewords and 7 are error correction codewords. Data may be encoded as numeric at $3$ numbers per $10$ bits, as alphanumeric at $2$ characters per 11 bits, as 8 bit bytes or as Kanji at $13$ bits per character. Data is encoded in groups of?mode,character count,character data bits?. The mode can change within the data stream. The mode is specified by a $4$ bit code and the character count by a varying number of bits depending on the mode and QR Code size. For the $21$-by-$21$ code, the character count bits are: \begin{tabular}{|l|l|l|} \textbf{Mode Name} & \textbf{Mode Bits} & \textbf{Count Bits} \\ \hline Numeric & 0001 & 10 \\ \hline Alphanumeric & 0010 & 9 \\ \hline 8 bit byte & 0100 & 8 \\ \hline Kanji & 1000 & 8 \\ \hline Termination & 0000 & 0 \\ \hline \end{tabular} The entire data stream ends in the termination code which may be truncated if there is not enough room. Any partially filled codeword after the termination code is filled with \textbf{0} bits. Any remaining codewords are set to \textbf{11101100} followed by \textbf{00010001} alternating.Numeric strings are encoded \textbf{3} digits at a time. If there are remaining digits, \textbf{2} digits are encoded in \textbf{7} bits or \textbf{1} digit in \textbf{4} bits. For example: \texttt{12345678 -> 123 456 78 -> 0001111011 0111001000 1001110} Prefix with mode (\textbf{0001}) and count (\textbf{8} -> \textbf{0000001000}) is (\textbf{4 + 10 + 10 + 10 +7}) bits: \textbf{0001 0000001000 0001111011 0111001000 1001110} Alphanumeric strings encode the haracters ( represents the space character): \textbf{0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\$\%*+-./:} as numbers from 0 to 44, then two characters are encoded in 11 bits: \textbf{ * 45 + } if the number of characters is odd, the last character is encoded in 6 bits. For example: \textbf{AC-42 -> (10,12,41,4,2) -> 10*45+12=462, 41*45+4=1849, 2->00111001110 11100111001 000010} Prefix with mode and count is (4 + 9 + 11 + 11+ 6) bits: \textbf{0010 000000101 00111001110 11100111001 000010} The 8 bit binary and Kanji modes will be straightforward for the purposes of this problem. Kanji codes will just be opaque 13 bit codes; you need not decode the characters they represent, just the hexadecimal values. For example: \textbf{8 bit 0x45 0x92 0xa3 -> 01000101 10010010 10100011} Prefix with mode and count is (4 + 8 + 8 + 8 + 8) bits: \textbf{0100 00000011 01000101 10010010 10100011}\textbf{ \textbf{Kanji 0x1ABC 07x0345 -> 1101010111100 0001101000101}} Prefix with mode and count is (4 + 8 + 13 + 13) bits: \textbf{1000 00000010 1101010111100 0001101000101} To illustrate forming the 19 codeword content of a QR Code, combine the first 3 sequences above (for numeric, alphanumeric and bytes). Concatenate the bits, split into 8bit code words add the termination codeword, any fill bits and fill bytes (41 + 41 + 36 data bits + 4 bit termination code = 122 -> 6 fill bits are needed to get 16 bytes, and to fill out the 19 bytes, 3 fill bytes are needed): \textbf{0001 0000001000 0001111011 0111001000 1001110}\textbf{ \textbf{0010 000000101 00111001110 11100111001 000010} \textbf{0100 00000011 01000101 10010010 10100011} \textbf{0000 000000 11101100 00010001 11101100}} split into 8 bit codewords: \textbf{00010000 00100000 01111011 01110010 00100111 00010000 00010100 11100111} \textbf{01110011 10010000 10010000 00001101 00010110 01001010 10001100 00000000} \textbf{11101100 00010001 11101100 -> HEX 10207B72271014E77390900D164A8C0EC11EC} Write a program to read 19 codewords and print the orresponding data. \InputFile The first line of input contains a single integer \textbf{P} (\textbf{1} ≤ \textbf{P} ≤ \textbf{1000}), which is the number of data sets that follow. Each data set is a single line of input consisting of the data set number \textbf{N}, followed by a single space and \textbf{38} hexadecimal digits giving the \textbf{19} bytes of QR Code data. The valid hexadecimal digits are \textbf{0}, \textbf{1}, \textbf{2}, \textbf{3}, \textbf{4}, \textbf{5}, \textbf{6}, \textbf{7}, \textbf{8}, \textbf{9}, \textbf{A}, \textbf{B}, \textbf{C}, \textbf{D}, \textbf{E} and \textbf{F}. \OutputFile For each data set there is one line of output. It contains the data set number (N) followed by a single space, the number of QR decoded characters in the result, a single space and the character string corresponding to the QR Code data. In the output string, printable ASCII characters (in the range \textbf{0x20} to \textbf{0x7e}) are printed as the ASCII character EXCEPT that backslash (\textbf{\textbackslash}) is printed as \textbf{\textbackslash} and pound sign (\textbf{#}) is printed as \textbf{\textbackslash #}. Non-printable \textbf{8} bit data is output as \textbf{\textbackslash xx}, where \textbf{x} is a hexadecimal digit (e.g. \textbf{\AE}). Non-printable \textbf{8} bit data is any value that is less than the ASCII value of a space (\textbf{0x20}) or greater than \textbf{0x76}. \textbf{13} bit Kanji values are printed as \textbf{#bxxx}, where \textbf{b} is \textbf{0} or \textbf{1} and \textbf{x} is a hexadecimal digit (e.g. \textbf{#13AC}).