#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int N;
struct suma
{	int val,x,y,z;
}v[1000001];
bool cmp(suma a,suma b)
{	return ( a.val<b.val );
}
bool search(int val,int &poz,int dr)
{	int mid,left,right;
	left=1; right=dr;
	while(left<=right)
	{	mid=(left+right)/2;
		if(v[mid].val==val) { poz=mid; return 1; }
		if(v[mid].val>val) right=mid-1;
		else left=mid+1;
	}
	return 0;
}
int main()
{	int S,i,j,k,x;
	int a[101];
	f>>N>>S;
	for(i=1;i<=N;i++)
		f>>a[i];
	for(i=1,x=0;i<=N;i++)
		for(j=1;j<=N;j++)
			for(k=1;k<=N;k++)
				v[++x].val=a[i]+a[j]+a[k] , v[x].x=a[i] , v[x].y=a[j] , v[x].z=a[k];
	sort(v+1,v+x+1,cmp);
	for(i=1;i<=N;i++)
		if(search(S-v[i].val,j,x))
		{	g<<v[i].x<<" "<<v[i].y<<" "<<v[i].z<<" "<<v[j].x<<" "<<v[j].y<<" "<<v[j].z; return 0; }
	g<<-1;
	f.close();
	g.close();
	return 0;
}