#include<cstdio>
#include<algorithm>
#include<map>
#define fi first
#define se second
using namespace std;
int n,S,s,i,j,k,a[102];
map<int, pair<int, int > > A;
map<int, pair<int, int > >::iterator it,jt;
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=i;j<=n;j++)
        {
            for(k=j;k<=n;k++)
            {
                s=a[i]+a[j]+a[k];
                A.insert(make_pair(s,make_pair(a[i],a[j])));
            }
        }
    }
    n=A.size();
    for(it=A.begin();it!=A.end();it++)
    {
        s=it->first;
        jt=A.find(S-s);
        if(jt!=A.end())
        {
            printf("%d %d %d ",it->second.first,it->second.second,it->first - it->second.first - it->second.second);
            printf("%d %d %d\n",jt->second.first,jt->second.second,jt->first - jt->second.first - jt->second.second);
            return 0;
        }
    }
    printf("-1\n");
    return 0;
}