#include<fstream>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
int n, s , S,x, a[1000001], b[1000001], i, u, d, j, k , l ,m, o, p;
int cautbin(int x)
{ int mij;
    int li=1; int ls=n;
    while(li<ls)
    { mij=(li+ls)/2;
      if(a[mij]==x)
          return x;
      else  if(a[mij]>x)
                        ls=mij-1;
      else li-mij+1;}
    return 0;    
}
void quickSort(int arr[], int left, int right) 
{
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];
 
      /* partition */
      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);
}
int main()
{
    cin>>n>>S;
    for(i=1;i<=n;i++)
       cin>>a[i];
    quickSort(a, 1, n);
    s=S;
    for(i=n;i>=1;i--) 
       for(j=n;j>=1;j--)
          for(k=n;k>=1;k--)
             for(l=n;l>=1;l--)
                for(m=n;m>=1;m--)
          //          for(o=n;o>=1;o--)
                        if(cautbin(S-(a[m]+a[l]+a[k]+a[j]+a[i])))
                              {cout<<S-(a[m]+a[l]+a[k]+a[j]+a[i])<<" "<<a[m]<<" "<<a[l]<<" "<<a[k]<<" "<<a[j]<<" "<<a[i]; 
    cin.close();
    cout.close();
                              return 0;}
    cout<<"-1";
    cin.close();
    cout.close();
    return 0;
}