#include<fstream>
#include<algorithm>
using namespace std;
struct grup{
int x,y,z;
int suma;
};
int v[103];
grup a[1092727];
bool cmp(grup s1,grup s2)
{
     return s1.suma<s2.suma;
}
int contor;
int cautare(int x)
{
    int st=1,dr=contor;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(a[mij].suma==x)
        {
            return mij;
        }
        if(a[mij].suma<x)
            st=mij+1;
        else
            dr=mij-1;
    }
    return -1;
}
int main()
{
    ifstream cin("loto.in");
    ofstream cout("loto.out");
    int n,s,contor=1;
    cin>>n>>s;
    for(int i=1;i<=n;++i)
    {
        cin>>v[i];
    }
    contor=0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            for(int k=1;k<=n;++k)
            {
                contor++;
                a[contor].x=i;
                a[contor].y=j;
                a[contor].z=k;
                a[contor].suma=v[i]+v[j]+v[k];
            }
    sort(a+1,a+contor+1,cmp);
    for(int i=1;i<=contor;++i)
    {
        if(cautare(s-a[i].suma))
        {
            int k=cautare(s-a[i].suma);
            cout<<v[a[k].x]<<" "<<v[a[k].y]<<" "<<v[a[k].z]<<" "<<v[a[i].x]<<" "<<v[a[i].y]<<" "<<v[a[i].z];
            return 0;
        }

    }
    cout<<-1;
}