2000 LSU Computer Science High School Programming Contest
Veteran Problem 9: Anagram

You are to write a program that has to generate all possible unique words from a given set of letters.

Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba".

In the word taken from input, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order. No input word will be longer than 8 letters.

Input

The input consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of lowercase letters from a to z.

Output

For each word in the input, the output should contain all different words that can be generated with the letters of the given word. The words generated from the same input word should be output in alphabetically ascending order.

Sample Input

2
abc
acba

Sample Output

abc
acb
bac
bca
cab
cba
aabc
aacb
abac
abca
acab
acba
baac
baca
bcaa
caab
caba
cbaa