/*

     Name: 排列2

     Copyright:

     Author:

     Date: 09/08/17 15:44

     Description: 全排列问题

 */

 #include<iostream>

 #include<algorithm>

 using namespace std;

 int main()

 {

     int num[],tag;

     tag = ;  //这里的初始化很有必要不然会出现一些很是奇怪的事情

     while(cin>>num[]>>num[]>>num[]>>num[])

     {

         if(num[]== && num[] ==  && num[] ==  && num[]== )

             break;

         if(tag)

             cout<<endl;

         tag = ;

         int temp = ;

         int temp1;

         do{

             if(num[] == )

                 continue;

             if(temp)

                 cout<<num[]<<num[]<<num[]<<num[];

             else if(temp1 == num[])

                 cout<<" "<<num[]<<num[]<<num[]<<num[];

             else

                 cout<<endl<<num[]<<num[]<<num[]<<num[];

             temp = ;

             temp1 = num[];

         }while(next_permutation(num,num+));

         cout<<endl;

     }

     return ;

 }