Given a string S containing only lower case alphabets, the task is to sort it in lexigraphically-descending order.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a string S.
For each test case, in a new line, print the sorted string.
1 <= T <= 100
1 <= |S| <= 105
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.