Mirror String

Given a string S, transform it into its mirrored form. Each character c in S is replaced by its counterpart in the reversed English alphabet. In other words, each character is mapped using the formula \(c' = \text{chr}(219 - \text{ord}(c))\), so that 'a' becomes 'z', 'b' becomes 'y', and so on.

Your task is to apply this transformation on every test case provided.

inputFormat

The first line contains an integer T, indicating the number of test cases. Each of the following T lines contains a string S composed of lowercase English letters.

outputFormat

For each test case, print the mirrored string on a new line.

2
abc
hello

zyx
svool