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

long long find(long long val)
 {
     long long st=1,dr=l,mij;
     while (st<=dr)
        {  mij=(st+dr)/2;
           if (sums[mij]==val)
             return mij;
           else
             if (sums[mij]<val)
               st=mij+1;
             else
               dr=mij-1;
        }
     return 0;
 }


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


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


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