#include<cstdio>
#include<algorithm>
using namespace std;
int i,n,j,k,s,a[101],nr;
struct camp
{
    int x,y,z;
}v[1000001];
int vec[1000001];
int cautbin(int val)
{
    int st,dr,mij;
    st=1;dr=nr;mij=(st+dr)/2;
    while (st<=dr)
    {
        if (vec[mij]<val) {st=mij+1;mij=(st+dr)/2;}
            else if (vec[mij]>val) {dr=mij-1;mij=(st+dr)/2;}
                else return mij;
    }
    if (vec[st]==val) return st;
    if (vec[dr]==val) return dr;
    return -1;
}
int main()
{
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    scanf("%d%d",&n,&s);
    for (i=1;i<=n;++i)
        scanf("%d",&a[i]);
    nr=0;
    for (i=1;i<=n;++i)
        for (j=i;j<=n;++j)
            for(k=j;k<=n;++k)
            {
                ++nr;
                vec[nr]=a[i]+a[j]+a[k];
                v[nr].x=a[i];
                v[nr].y=a[j];
                v[nr].z=a[k];
            }
    sort(vec+1,vec+nr+1);
    int e=0;
    for (i=1;i<nr;++i)
    {
        int poz=cautbin(s-vec[i]);
        if (poz!=-1)
        {
            printf("%d %d %d %d %d %d\n",v[i].x,v[i].y,v[i].z,v[poz].x,v[poz].y,v[poz].z);
            e=1;
            break;
        }
    }
    if (e==0) printf("-1\n");
    return 0;
}