#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 101

using namespace std;

ifstream f("loto.in");
ofstream g("loto.out");

int i, j, k, n, s, nr, x[NMAX];

struct loto
{
    int unu, doi, trei, val;
};

loto v[NMAX*NMAX*NMAX];

bool cmp(loto a, loto b)
{
    return a.val<b.val;
}

int cautbin(int x)
{
    int st, dr, med;
    st=1;
    dr=n*n*n;

    while (st<=dr)
    {
        med=(st+dr)/2;
        if (v[med].val==x) return med;
        else
            if (x<v[med].val) dr=med-1;
        else
            if (x>v[med].val) st=med+1;
    }
    return -1;
}

int main()
{
    f>>n>>s;

    for (i=1; i<=n; ++i)
    f>>x[i];

    int cont=0;

    for (i=1; i<=n; ++i)
        for (j=1; j<=n; ++j)
        for (k=1; k<=n; ++k)
        {
            cont++;
            v[cont].val=x[i]+x[j]+x[k];
            v[cont].unu=x[i];
            v[cont].doi=x[j];
            v[cont].trei=x[k];
        }

    sort(v+1, v+n*n*n+1, cmp);

    bool gasit=0;

    for (i=1; i<=n*n*n; ++i)
    {
        int x=cautbin(s-v[i].val);
        if (x!=-1)
        {
            g<<v[i].unu<<" "<<v[i].doi<<" "<<v[i].trei<<" "<<v[x].unu<<" "<<v[x].doi<<" "<<v[x].trei<<'\n';
            gasit=1;
            return 0;
        }
    }

    if (!gasit) g<<"-1\n";

    return 0;
}