#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int N=4;
int num[N];
int isSolve=0;
int main()
{
    int A[N];
    while(cin>>A[0]>>A[1]>>A[2]>>A[3])
    {
        sort(A,A+4);
        do{
            for(int i=0;i<3;i++)
                printf("%d ",A[i]);
            printf("\n");

        }while (next_permutation(A,A+4));
    }

    return 0;
}