Lexicographically Smallest String Transformation

Given a string s, transform it into its lexicographically smallest possible string by replacing each character with the character a. The transformation is done by simply replacing every character in the string with a, resulting in a new string of equal length consisting only of the letter a.

For example, if s = "bacd", the output should be "aaaa".

This problem is designed to test basic string manipulation and input/output handling in competitive programming.

inputFormat

The first line of input contains an integer T representing the number of test cases. This is followed by T lines, each containing a non-empty string.

outputFormat

For each test case, output a single line containing the lexicographically smallest transformation of the input string (i.e., a string of the same length where every character is 'a').

## sample

3
abe
xyz
bacd

aaa
aaa
aaaa

</p>