# Permutation of letters

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Given a string consisting of $m$ symbols. Print all permutations of symbols for this string.

## Input

One string consisting of $m(2≤m≤8)$ of symbols — Latin letters and digits.

## Output

Print all permutations for the given string in lexicographical order.

## Examples

Input #1

Answer #1

Submissions 2K

Acceptance rate 40%