#include<iostream>
#include<algorithm>    //next_permutation
using namespace std;
int deal(int n)
{
   int sum=1;
   for (int i=1;i<=n;i++)
        sum*=i;
        return sum;
}
int main()
{
    int x[5],f,flag=0;
    while (1)
    {

        cin>>x[0]>>x[1]>>x[2]>>x[3];
        if(x[0]==0&&x[1]==0&&x[2]==0&&x[3]==0)
            return 0;

      if(flag!=0)
        cout << endl;
        flag=1;
        int w=0;
        sort(x,x+4);   //排序，默认升序，头文件algorithm
        f=0;
      do
      {
          if (x[0]==0)
            continue;
            if (f==0)
            {
                cout << x[0] << x[1] << x[2] << x[3] ;
                f=1;
            }
            else
            {
                if (w==x[0])
                    cout << ' ' << x[0] << x[1] << x[2] << x[3] ;
                else
                    cout << endl  << x[0] << x[1] << x[2] << x[3]  ;

            }
            w=x[0];
      }
      while (next_permutation(x,x+4));
  cout << endl;
    }
    return 0;
}