#K79127. Standardized Identifiers

    ID: 35240 Type: Default 1000ms 256MiB

Standardized Identifiers

Standardized Identifiers

You are given an integer \(n\) and \(n\) strings that represent the characteristics of various organisms. For each string, your task is to generate its standardized identifier by sorting its characters in ascending order.

In other words, for each string \(s\) given, you need to output a new string \(t\) which is the sorted version of \(s\). Formally, if \(s = s_1s_2\cdots s_m\), then the output string \(t\) is the result of sorting the sequence \(\{s_1, s_2, \ldots, s_m\}\) in non-decreasing order.

Example: For the string "bac", the standardized identifier is "abc".

This task evaluates your ability to process strings and implement sorting algorithms efficiently.

inputFormat

The first line of the input contains a single integer \(n\) \(\left(1 \leq n \leq 10^5\right)\), representing the number of organisms. The following \(n\) lines each contain a non-empty string consisting of lowercase English letters, which represents the characteristic of an organism. Each string's length will not exceed 1000 characters.

outputFormat

Output \(n\) lines. The \(i\)-th line should contain the standardized identifier of the \(i\)-th organism, which is the string obtained after sorting the characters of the original string in ascending order.

## sample
3
bac
abc
cba
abc

abc abc

</p>