#include<fstream>
#include<vector>
#include<algorithm>
#define MAXN 102
#define pb push_back

using namespace std;

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

struct loto
{
	int suma,x,y,z;
};

bool cmp(loto param,loto param1)
{
	return param.suma<param1.suma;
}


loto s[MAXN*MAXN*MAXN];

int v[MAXN],sum,n,l,m;

inline void read()
{
	int i;
	in>>n>>sum;
	for(i=1;i<=n;i++)
		in>>v[i];
}

inline void sume()
{
	int i,j,k;
	for(i=1;i<=n;i++)
		for(j=i;j<=n;j++)
			for(k=j;k<=n;k++)
			{
				s[++l].suma=v[i]+v[j]+v[k];
				s[l].x=v[i];
				s[l].y=v[j];
				s[l].z=v[k];
			}
}

inline void rezolvare()
{
	int stg,dr;
	for(int i=1;i<=l;i++)
	{
	stg=1;
	dr=l;
	while(stg<=dr)
	{
		int mij=(stg+dr)/2,sumisoara=s[i].suma+s[mij].suma;
		if(sumisoara==sum)
		{
			out<<s[i].x<<" "<<s[i].y<<" "<<s[i].z<<" "<<s[mij].x<<" "<<s[mij].y<<" "<<s[mij].z<<"\n";
			return;
		}
		if(sumisoara>sum)
			stg++;
		else
			dr--;
	}
	}
	out<<"-1\n";
}

int main()
{
	read();
	sume();
	sort(s,s+l,cmp);
	rezolvare();
	return 0;
}