#include<fstream>
#include<map>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,i,v[101],j,k,s,found;
struct loto
{
    int i1,i2,i3;
};
int main()
{
    fin>>n>>s;
    for(i=1;i<=n;i++)
        fin>>v[i];
    map<int,loto>Map;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=n;k++)
            {
                Map[v[i]+v[j]+v[k]]={i,j,k};
            }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=n;k++)
            {
                int sum=v[i]+v[j]+v[k];
                int sum2=s-sum;
                if(!found)
                if(Map.find(sum2)!=Map.end())
                {
                    fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[Map[sum2].i1]<<" "<<v[Map[sum2].i2]<<" "<<v[Map[sum2].i3]<<"\n";
                    found=true;
                }
            }
    if(!found) fout<<-1;
    return 0;
}