#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n, s, a[105], np;
struct loto{
    int s, a, b, c;
    loto()
    {
        s = a = b = c = 0;
    }
    loto (int ss, int aa, int bb, int cc)
    {
        s = ss;
        a = aa;
        b = bb;
        c = cc;
    }

}v[1000000];
bool cmp(loto a, loto b)
{
    return a.s<b.s;
}
int main()
{
    fin>>n>>s;
    for(int i=1;i<=n;++i)
        fin>>a[i];
    fin.close();
    for(int i=1;i<=n;++i)
        for(int j=i;j<=n;++j)
            for(int k=j;k<=n;++k)
                {
                    v[++np] = loto(a[i]+a[j]+a[k], a[i], a[j], a[k]);
                }
    sort(v+1, v+1+np, cmp);
    for(int i=1;i<=np;i++)
    {
        int x=v[i].s, st=1, dr=np;
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            if(v[mij].s==s-x)
            {
                fout<<v[mij].a<<' '<<v[mij].b<<' '<<v[mij].c<<
                ' '<<v[i].a<<' '<<v[i].b<<' '<<v[i].c<<'\n';
                fout.close();
                return 0;
            }
            if(v[mij].s<s-x)
                st=mij+1;
            else
                dr=mij-1;
        }
    }
    fout<<"-1\n";
    fout.close();
    return 0;
}