Print Permutations - String Problem Statement

Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.

Input:

The first and only line of input contains a string 'S' of alphabets in lower case characters.

Output:

Print all the permutations of the given string 'S' on separate lines.

Example:

Input: "abc"
Output: 
abc
acb
bac
bca
cab
cba

Constraints:

• 0 <= |S| <= 8

Note:

• The input string may contain the same characters, so there can be duplicate permutations.
• The order of permutations does not matter.
• You do not need to print anything; it has already been taken care of. Implement the function to return the answer.