We have a string \(X\), we want to find another string \(Y\) that has the same meaning of string \(X\).
Two strings have the same meaning if and only if they have the same length and all the characters of the english alphabet (case sensitive) have the same number of occurrences in both strings.
The first line will contain the number of test cases \(T\).
Each test case will consist of one line containing a single alphabetic string
\(X\) (\(1 \leq |X| \leq 100\))
the string for which you need to find one with the same meaning.
For each test case, output, in a single line, a string \(Y\) that has the same meaning of the input string.
If there are multiple strings with the same meaning, print any one of them.
4 uBiPhTqY afmEuh SuoUM XcxtWIeoE
hBqiuTYP umafEh oMSuU EWeIctoxX