#include <fstream>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
int main()
{
    int v[1000000],n,s,m,o,p,q,r,t;
   

  int partition(int arr[], int left, int right)
{

      int i = left, j = right;

      int tmp;

      int pivot = arr[(left + right) / 2];

     

      while (i <= j) {

            while (arr[i] < pivot)

                  i++;

            while (arr[j] > pivot)

                  j--;

            if (i <= j) {

                  tmp = arr[i];

                  arr[i] = arr[j];

                  arr[j] = tmp;

                  i++;

                  j--;

            }

      };
 
      if (left < j)

            quickSort(arr, left, j);

      if (i < right)

            quickSort(arr, i, right);
            
            for(m=n;m>=1;m--)
            for (o=n;o>=1;o--)
            for (p=n;p>=1;p--)
            for (q=n;q>=1;q--)
            for (r=n;r>=1;r--)
            for (t=n;t>=1;t--)
            if (v[m]+v[o]+v[p]+v[q]+v[r]+v[t]==s)
            cout<<(v[m]<<(v[o]<<(v[p]<<v[q]<<v[r]<<(v[t]<<endl;
            else cout<<-1;
            
            return 0;
            }