#include <stdio.h>
FILE *fin,*fout;
long sums[1000001],as[1000001],bs[1000001],cs[1000001];
long poz,hsize,n,i,j,k,s,l,a[101];

inline void inter(int i,int j)
 { int auxs,auxa,auxb,auxc;
   auxs=sums[i];
   auxa=as[i];
   auxb=bs[i];
   auxc=cs[i];
   sums[i]=sums[j];
   as[i]=as[j];
   bs[i]=bs[j];
   cs[i]=cs[j];
   sums[j]=auxs;
   as[j]=auxa;
   bs[j]=auxb;
   cs[j]=auxc;
 }


long find(long val)
 {
     int i, step;
     for (step = 1; step <= l; step <<= 1);
     for (i = 0; step; step >>= 1)
         if (i + step <= l && sums[i + step] <= val)
            i += step;
     if (sums[i]==val)
     return i;
     return 0;
 }


void reheap (int i)
 { int l=2*i,r=2*i+1,max=i;
   long aux;
   if (l<=hsize&&sums[l]>sums[i])
      max=l;
   if (r<=hsize&&sums[r]>sums[max])
      max=r;
   if (max!=i)
     { inter(i,max);
       reheap(max);
     }
 }


void hsort()
 { hsize=l;
   long aux;
   int i;
   for (i=l/2;i>=1;i--)
      reheap(i);
   for (i=l;i>=2;i--)
      {  inter(1,i);
         hsize--;
         reheap(1);
      }
 }


int main()
{
 fin=fopen("loto.in","rt");
 fout=fopen("loto.out","wt");
 fscanf(fin,"%ld %ld",&n,&s);
 for (i=1;i<=n;i++)
    fscanf(fin,"%ld",&a[i]);
 l=1;
 for (i=1;i<=n;i++)
    for (j=1;j<=n;j++)
       for (k=1;k<=n;k++)
        if (a[i]+a[j]+a[k]<=s)
          {
          sums[l]=a[i]+a[j]+a[k];
          as[l]=a[i];
          bs[l]=a[j];
          cs[l]=a[k];
          l++;
         }
 l--;
 hsort();
 for (i=1;i<=l;i++)
       { if (s-sums[i]<=sums[l]&&sums[i]!=sums[i-1])
         {
         poz=find(s-sums[i]);
         if (poz)
         { fprintf(fout,"%ld %ld %ld %ld %ld %ld\n",as[i],bs[i],cs[i],as[poz],bs[poz],cs[poz]);
           return 0;
         }
         }
       }
 fprintf(fout,"-1\n");
 return 0;
}