PROGRAMMING:Full Permutation of strings

Given a string composed of all lowercase letters, find its full permutation and output from small to large in dictionary order.
###Input format:
One line, one string, length no more than 8.
###Output format:
Output all permutations, one permutation for each line, dictionary order from small to large.
###Input example:
Here is a set of inputs. For example:
```in
abc
```
###Output example:
The corresponding output is given here. For example:
```out
abc
acb
bac
bca
cab
cba
```







answer：If there is no answer, please comment