#include<cstdio>
#include<algorithm>

using namespace std;


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

struct poz{int sum,x,y,z;}p[1000001];
bool operator<(const poz &a, const poz &b)
{       return (a.sum<b.sum);}
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]);
        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;
        l--;
        sort(p,p+l);
        for(i=1;i<=l;i++)
        {       st=1,dr=l;
                while(st<=dr)
                {       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]);
                                return 0;
                        }
                        else    if(p[i].sum+p[mid].sum>s)
                                        dr=mid-1;
                                else
                                        st=mid+1;
                }
        }
        printf("-1");
        return 0;
}