#include <fstream>
#include <algorithm>
using namespace std;
long v[1000];
int main()
{
	ifstream f("loto.in");
	ofstream g("loto.out");
	int n,i,j,OK=0,S,x,k;
	f>>n; f>>S; k=0;
	for(i=1;i<=n;i++) 
	{	f>>x;
		for(j=1;j<=6;j++) v[++k]=x;
	}
	sort(v+1,v+6*n+1);
	for(i=1;i<=6*n;i++)
	{	if(v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]==S) {OK=1; g<<v[i]<<" "<<v[i+1]<<" "<<v[i+2]<<" "<<v[i+3]<<" "<<v[i+4]<<" "<<v[i+5];}
	}
	if(OK==0) g<<-1;
	f.close();
	g.close();
	return 0;
}