In chess, bishop is the chessman which can only move diagonally. It is well-known that bishops can reach only fields of one color but all of them, in some number of moves (assuming that there are no other figures on the board). You are given two coordinates of a chessboard and should determine if a bishop can reach the second field from the first one and if so, then how. Coordinates in chess are given by a letter ('A' to 'H') and a number (1 to 8). The letter specifies the column (file), the number specifies the row (rank) on the chessboard.
The input starts with the number of test cases. Each test case consists of one line, containing the start position X and the end position Y. Each position is given by two space-separated characters: a letter for the column and a number for the row. There are no duplicate test cases in one input.
Output one line for every test case. If it's not possible to move a bishop from X to Y in any number of moves, output “Impossible”. Otherwise, output one possible move sequence from X to Y. Output the number n of moves first (allowed to be 4 at most), followed by n + 1 positions, which describe the path the bishop has to move. The characters should be separated by single spaces. There may be many possible solutions. Any one with at most 4 moves will be accepted. Remember that in a chess move, at least one chessman (the bishop in this case) has to change its position to be a valid move (i.e., two consecutive positions in the output must differ).
Output for Sample Input
|University of Debrecen; Faculty of Informatics; v. 03/01/2019|