#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
const double inf=1e20;
const int maxn=100+10;
const int mod=1e9+7;

int main(){
    char a,b,c;
    while(scanf("%c%c%c%*c",&a,&b,&c)!=EOF){
        if(a>b)swap(a,b);
        if(b>c)swap(b,c);
        if(a>b)swap(a,b);
        printf("%c %c %c\n",a,b,c);
    }
}