#include <fstream>
#include <algorithm>
using namespace std;
int a[101],i,q,j,k,st,dr,mij,sum,sdat,n;
struct bilet{int suma;int e1;int e2;int e3;};
bilet v[1000002];
bool ok;
inline bool cmp(bilet x, const bilet &y)
{
    return x.suma<y.suma;
}
int main()
{
    ifstream f("loto.in");
    ofstream g("loto.out");
    f>>n>>sdat;
    for (i=1;i<=n;i++) f>>a[i];
    sort(a+1,a+n+1);ok=false;
    q=1;
    for (i=1;i<=n;i++)
       for (j=i;j<=n;j++)
         for (k=j;k<=n;k++)
           v[q].suma=a[i]+a[j]+a[k],v[q].e1=a[i],v[q].e2=a[j],v[q].e3=a[k],q++;
    sort(v+1,v+q+1,cmp);
    for (i=1;i<=q;i++)
    {
        st=1;dr=q;sum=sdat-v[i].suma;
        while (st<=dr)
        {
            mij=(st+dr)/2;
            if (v[mij].suma==sum)
            {
                g<<v[i].e1<<" "<<v[i].e2<<" "<<v[i].e3<<" "<<v[mij].e1<<" "<<v[mij].e2<<" "<<v[mij].e3<<'\n';
                ok=true;i=q+1;break;
            }
            else
                if (v[mij].suma<sum) st=mij+1;
                  else dr=mij-1;
        }
    }
    if (!ok) g<<"-1"<<'\n';
    f.close();
    g.close();
    return 0;
}