#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int N = 1e6+10;
int t,n,m,k,l,r,op,x,y;
int f[N];
bool flag;
//int dp[N][N];
void solve(){
    string str;
    cin>>str;
    do{
        cout<<str<<"\n";
    }while(next_permutation(str.begin(),str.end()));

}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);  
    solve();
    return 0;
}