Permutation_Of_String

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pb push_back
#define fe first
#define se second
#define nl "\n"
#define pp pair < ll , ll >
#define sz(x) (ll)x.size()
#define st(x) sort(x.begin(),x.end())
#define rst(x) sort(x.rbegin(), x.rend())
#define all(x) x.begin(),x.end()
long double pi = 3.14159265358979323;

const double EPS = 1e-12;
const int N = 1e6 + 5;
//Just A Gentle Reminder about MOD
const int mod = 1e9 + 7;

//print all permutation of a string with duplicates

void permute(string &s , int l , int r){
        if(l == r){
            cout << s << nl;
            return ;
        }
        for(int i = l ; i <= r ; i++ ){
            swap(s[i] , s[l]);
            permute(s , l + 1 , r);
            swap(s[i],s[l]);
        }
}

int main()
{
    fast;
    string s;
    cin >> s ;
    permute(s,0,s.size()-1);























    return 0;
//It's not end it yet
}