#include <bits/stdc++.h>
using namespace std;

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

struct triplet{
    int a, b, c;
};

unordered_map<int,triplet> v;

int main()
{
    int numar[101], s, n, suma=0, i, j, k;
    f>>n>>s;
    for(i=0; i<n; i++)

        f>>numar[i];
    for(i=0; i<n; i++)
        for(j=i; j<n; j++)
            for(k=j; k<n; k++)
            {
                triplet x;
                suma=0;
                x.a=i;
                x.b=j;
                x.c=k;
                suma=numar[i]+numar[j]+numar[k];
                v[suma]=x;
            }
    for(i=0; i<n; i++)
        for(j=i; j<n; j++)
            for(k=j; k<n; k++)
            {
                suma=0;
                suma=s-numar[i]-numar[j]-numar[k];
                if(v.find(suma)!=v.end())
                {
                    triplet y=v[suma];
                    g<<numar[i]<<" "<<numar[j]<<" "<<numar[k]<<" "<<numar[y.a]<<" "<<numar[y.b]<<" "<<numar[y.c]<<'\n';
                    return 0;
                }
            }
    g<<-1<<'\n';
    return 0;

}