#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int a[101],b[1000009],n,m,i,j,k,s,sum1,sum2,sol[7],p;
int main()
{
     f>>n>>s;
     for(i=1;i<=n;i++)
        f>>a[i];
     for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++)
                b[++m]=a[i]+a[j]+a[k];
     sort(b+1,b+m+1);
     //for(i=1;i<=m;i++) fo<<b[i]<<" "; fo<<'\n';

     for(i=1;i<=m;i++)
      if(binary_search(b+1,b+m+1,s-b[i])){
            sum1=b[i];
            sum2=s-b[i];
            break;
      }
     for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++)
            {
                if(a[i]+a[j]+a[k]==sum1){
                    sol[1]=a[i];
                    sol[2]=a[j];
                    sol[3]=a[k];
                }
                if(a[i]+a[j]+a[k]==sum2){
                    sol[4]=a[i];
                    sol[5]=a[j];
                    sol[6]=a[k];
                }
            }
    if(sum1==0 and sum2==0)
        g<<-1;
    else{
        for(i=1;i<=6;i++)
            g<<sol[i]<<" ";
    }
    return 0;
}