#include<cstdio>
#include<algorithm>

using namespace std;


int a[101],k,i,n,s,sum[1000001],j,l=1;

struct poz{int sum,x,y,z;}p[1000001];
bool operator<(const poz &a, const poz &b)
{       return (a.sum<b.sum);}
/*void divide(int s, int d, int&m)
{       int i=s,j=d,pi=0,pj=1;
        while(i<j)
        {       if(sum[i]>sum[j])
                        sum[i]^=sum[j]^=sum[i]^=sum[j],pi^=pj^=pi^=pj,
                        p[i].x^=p[j].x^=p[i].x^=p[j].x,
                        p[i].y^=p[j].y^=p[i].y^=p[j].y,
                        p[i].z^=p[j].z^=p[i].z^=p[j].z;
                i+=pi;j-=pj;
        }
        m=i;
}
void qsort(int s, int d)
{       int m;
        if(s<d)
                divide(s,d,m),
                qsort(s,m-1),
                qsort(m+1,d);
} */
int main()
{       register int ok=0,mid,st,dr;
        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]);
        for(i=1;i<=n;i++)
                for(j=1;j<=n;j++)
                        for(k=1;k<=n;k++)
                                p[l].sum=a[i]+a[j]+a[k],
                                p[l].x=i,p[l].y=j,p[l++].z=k;
        sort(p,p+l);
        for(i=1;i<=l&&!ok;i++)
        {       st=1,dr=l;
                while(st<=dr&&!ok)
                {       mid=(st+dr)/2;
                        if(p[i].sum+p[mid].sum==s)
                                printf("%d %d %d %d %d %d",a[p[i].x],a[p[i].y],a[p[i].z],a[p[mid].x],a[p[mid].y],a[p[mid].z]),
                                ok=1;
                        else    if(p[i].sum+p[mid].sum>s)
                                        dr=mid-1;
                                else
                                        st=mid+1;
                }
        }
        if(!ok) printf("-1");
        return 0;
}