##### DWITE Online Computer Programming Contest, October 2009, Problem 2

Looking to find some clever anagrams, you want a helper tool that will list all possible arrangements of letters for a given source word. To make the list easier to scan, the output should be in ascending sorted order.

The input contains 5 lines, a string of lowercase alphabet characters, at least 1 character long, and no more than 5.

The output contains all the possible combinations of letters in each word, sorted alphabetically.

*To make things easier, all of the letters in each word are guaranteed to be unique (so then every combination will also be unique).*

*Note: since there are possibilities for combinations of letters, you can use that fact to check that you have the right number of possibilities in your output.*

#### Sample Input

```
a
ab
abc
```

#### Sample Output

```
a
ab
ba
abc
acb
bac
bca
cab
cba
```

Problem Resource: DWITE

## Comments

This question is almost the same as https://dmoj.ca/problem/ics4p1

Sample input should be five lines