\includegraphics{https://static.e-olymp.com/content/2d/2d6d17518078e2ee748774d32fba0dd0e5b6089e.jpg} The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessboard he is living on. Our knight lives on a chessboard that has a smaller area than a regular \textbf{8}×\textbf{8} board, but it is still rectangular. Can you help this adventurous knight to make travel plans? Find a path such that the knight visits every square once. The knight can start and end on any square of the board. \InputFile The input begins with a positive integer \textbf{n} in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers \textbf{p} and \textbf{q}, such that \textbf{1} ≤ \textbf{p}×\textbf{q} ≤ \textbf{26}. This represents a \textbf{p}×\textbf{q} chessboard, where \textbf{p} describes how many different square numbers \textbf{1}, ..., \textbf{p} exist, \textbf{q} describes how many different square letters exist. These are the first \textbf{q} letters of the Latin alphabet: \textbf{A}, ..., \textbf{Z}. \OutputFile The output for every scenario begins with a line containing "\textbf{Scenario #i:}", where \textbf{i} is the number of the scenario starting at \textbf{1}. Then print a single line containing the lexicographically first path that visits all squares of the chessboard with knight moves followed by an empty line. The path should be given on a single line by concatenating the names of the visited squares. Each square name consists of a capital letter followed by a number. If no such path exist, you should output "\textbf{impossible}" on a single line.