题目描述
The chef has a number N, Cheffina challenges chef to form the largest number X from the digits of N.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- Each test case contains a single line of input, $N$.
-----Output:-----
For each test case, output in a single line answer.
-----Constraints-----
- $1 \leq T \leq 10^5$
- $1 \leq N \leq 10^6$
-----Sample Input:-----
2
2
212
-----Sample Output:-----
2
221
输入格式
见题面
输出格式
见题面
样例输入
['2', '2', '212']
样例输出
['2', '221']