Decode the Message

No attempts yetTime limit1sMemory limit256 MB

Problem

Your friends Alex and Adam built a secret system for sending messages to each other. The system turned out to be too hard to run by hand, so Alex asked you to write a program that decodes the secret messages. After making you swear never to reveal the system, he explained the rules.

A coded message is made of one or more words. Each word uses only the lower case letters a to z, and a single space separates one word from the next. Each word stands for one character. Add up the values of the letters in the word, then take the remainder when that sum is divided by 27. The letter a has value 0, b has value 1, and so on up to z, which has value 25. A remainder from 0 to 25 maps back to a to z by the same rule, and a remainder of 26 maps to a space.

Write a program that reads a coded message and prints the decoded message.

Input

The first line contains a single integer TT, the number of test cases. Each of the next TT lines contains one secret message. A secret message contains only lower case letters and spaces, spaces appear only between words, and two or more spaces never appear in a row.

  • 0<T1000 < T \le 100
  • Each secret message contains at most 10001000 characters.

Output

For each test case, print the decoded message on its own line. A decoded message can begin or end with a space.