Decoding the Shifting Cipher

In this problem, you are given an encoded message that has been ciphered by a shifting cipher with an unknown shift value \(0 \le k < 26\). Your task is to decode the message by generating all possible original strings corresponding to each shift value. If multiple messages are provided, decode each separately and separate the outputs of different messages with a blank line.

inputFormat

The first line contains an integer \(T\) (\(1 \le T \le 100\)), representing the number of encoded messages. Each of the following \(T\) lines contains a single encoded message consisting only of lowercase letters.

outputFormat

For each encoded message, output 26 lines. Each line should contain the decoded string obtained by shifting the message by \(k\) (from 0 to 25). After printing the 26 lines for a message, output an empty line.

1
ebiil

ebiil
dahhk
czggj
byffi
axeeh
zwddg
yvccf
xubbe
wtaad
vszzc
uryyb
tqxxa
spwwz
rovvy
qnuux
pmttw
olssv
nkrru
mjqqt
lipps
khoor
jgnnq
ifmmp
hello
gdkkn
fcjjm