#include <bits/stdc++.h>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
unordered_map <int , pair <int , int > > H;
int a[105],sum,n,i,j,k,aux,x,y,z;

int main()
{
    f>>n>>sum;

    for (i=1;i<=n;i++)
        f>>a[i];

    sort (a+1,a+n+1);

    for (i=1;i<=n;i++)
        for (j=i;j<=n;j++)
           for (k=j;k<=n;k++)
              H[a[i]+a[j]+a[k]]=make_pair(a[i],a[j]);

    for (i=1;i<=n;i++)
        for (j=i;j<=n;j++)
           for (k=j;k<=n;k++)
            {
                aux=sum-a[i]-a[j]-a[k];
                x=H[aux].first;
                y=H[aux].second;
                z=aux-x-y;
                if (x)
                {
                    g<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<x<<" "<<y<<" "<<z;
                    return 0;
                }
            }

    g<<"-1"<<'\n';

    return 0;
}