Lexicographically Minimum String

You are given a list of strings. For each string, you must sort its characters and output the result. For example, given the string "bdac", the lexicographically minimum arrangement is "abcd". This problem tests your ability to perform string manipulation and sorting.

Mathematically, if a string s contains characters, then its lexicographically minimum representation is given by $$s' = sort(s)$$, where sort(s) sorts the characters in ascending order.

The input format is as follows. The first line contains an integer t representing the number of test cases. The following t lines each contain a string. For each string, output its sorted version on a new line.

inputFormat

The first line contains a single integer t (1 ≤ t ≤ 10⁵), representing the number of test cases. Each of the following t lines contains a single string. The string may be empty and will consist of lowercase English letters.

outputFormat

For each test case, output a line containing the lexicographically minimum form of the input string, i.e., the string with its characters sorted in ascending order.

## sample

1
bdac

abcd

</p>