#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int i1,i2,i3,i,n,v[110],t,S,poz,R;
struct el
{
	int p1,p2,p3,s;
}D[200010];
int cm(el A,el B)
{
	return A.s<B.s;
}
int cb(int k)
{
	int p=1,u=n,m=(p+u)/2;
	while(p<=u)
	{
		m=(p+u)/2;
		if(k>D[m].s)
		p=m+1;
		else
		if(k<D[m].s)
		u=m-1;
		else
		if(k==D[m].s)
		return m;
	}
	return 0;
}
void write()
{
	g<<v[D[i].p1]<<" "<<v[D[i].p2]<<" "<<v[D[i].p3]<<" "<<v[D[poz].p1]<<" "<<v[D[poz].p2]<<" "<<v[D[poz].p3];
}
int main ()
{
	f>>n>>S;
	for(i=1;i<=n;++i)
	f>>v[i];
	for(i1=1;i1<=n;++i1)
	for(i2=i1;i2<=n;++i2)
	for(i3=i2;i3<=n;++i3)
	{
		D[++t].s=v[i1]+v[i2]+v[i3];
		D[t].p1=i1;
		D[t].p2=i2;
		D[t].p3=i3;
	}
	sort(D+1,D+t+1,cm);
	n=t;
	t=t/2+1;
	for(i=1;i<=t;++i)
	{
		R=S-D[i].s;
		poz=cb(R);
		if(poz)
		{
		write(); return 0;
		}
	}
	g<<-1;
	return 0;
}