#include <fstream>
#include <algorithm>
using namespace std;
typedef struct pere {int s,x,y;};
pere d[1000001];
int n,x,v[101];
inline int cmp(pere x, pere y)
{
    return x.s<y.s;
}

int main()
{
    int i,j,k,q;
	long long S;
    ifstream f("loto.in");
	ofstream g("loto.out");
    f>>n; f>>S; k=0;
    for (i=1;i<=n;++i)
        f>>v[i];
    for (i=1;i<=n;++i)
        for (j=i;j<=n;++j)
            for (q=j;q<=n;++q)
            {
                d[++k].s=v[i]+v[j]+v[q];
                d[k].x=v[i];
                d[k].y=v[j];
            }
    sort(d,d+k,cmp);
    i=0; j=k-1;
    while((i<=j)&&(d[i].s+d[j].s!=S))
        if (d[i].s+d[j].s>S) --j;
        else ++i;
    if (d[i].s+d[j].s!=S) g<<-1;
    else g<<d[i].y<<" "<<d[i].x<<" "<<d[i].s-d[i].y-d[i].x<<" "<<d[j].y<<" "<<d[j].x<<" "<<d[j].s-d[j].x-d[j].y;
    return 0;
}