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 file **DATA2.txt** will contain 5 lines, each being a string of lower-case alphabet characters, at least 1 character long, and no more than 5.

The output file **OUT2.txt** will contain 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 n! possibilities for combinations of n letters, you can use that fact to check that you have the right number of possibilities in your output.*

```
a
ab
abc
```

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