The first line of input gives the number of cases, T (1 ≤ T ≤ 30), then there is a blank line before the first test case. Each test case represents a message, which is composed by 1 ≤ N ≤ 100 lines and each line is composed by 1 ≤ M ≤ 30 words. Two words in the same line are separated by one or more white spaces. A word is formed by the letters A-Z and a-z and has at most 30 letters. The only symbols that appear in the input are the alphabetic letters and white spaces. There will be a blank line after each message.
For each test case you must print the number of the test case and each word of the decoded message, one per line (look the sample output for the exact format). You must print a blank line between each test case.