#include <iostream>

#include <algorithm>

#include <cstring>

#include <cstdio>

#include <vector>

#include <queue>

#include <cstdlib>

#include <iomanip>

#include <cmath>

#include <ctime>

#include <map>

#include <set>

using namespace std;

#define lowbit(x) (x&(-x))

#define max(x,y) (x>y?x:y)

#define min(x,y) (x<y?x:y)

#define MAX 100000000000000000

#define MOD 1000000007

#define pi acos(-1.0)

#define ei exp(1)

#define PI 3.141592653589793238462

#define ios() ios::sync_with_stdio(false)

#define INF 0x3f3f3f3f

#define mem(a) (memset(a,0,sizeof(a)))

typedef long long ll;

set<int>s[];

int a[];

int main()

{

    int ok=;

    while(scanf("%d%d%d%d",&a[],&a[],&a[],&a[])&& (a[],a[],a[],a[]))

    {

        if(ok) printf("\n");

        ok++;

        for(int i=;i<;i++) s[i].clear();

        do{

            if(a[]==) continue;

            int ans=;

            for(int i=;i<;i++)

            {

                ans=ans*+a[i];

            }

            s[a[]].insert(ans);

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

        for(int i=;i<;i++)

        {

            if(s[i].size()==) continue;

            bool flag=true;

            for(set<int>::iterator it=s[i].begin();it!=s[i].end();it++)

            {

                if(!flag) printf(" ");

                printf("%d",*it);

                flag=false;

            }

            printf("\n");

        }

    }

    return ;

}