#include <iostream>
#include <fstream>
#include <unordered_map>

using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");

int n,s,i,j,l,nr;
int v[105];
struct per
{	int f,s,t;	};
unordered_map<int,per> ump;

int main() {
	
	fin>>n>>s;
	for(i=1;i<=n;i++)
		fin>>v[i];
	
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(l=1;l<=n;l++)
				ump.insert({v[i]+v[j]+v[l], {v[i],v[j],v[l]}});
	
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(l=1;l<=n;l++)
			{
				nr=v[i]+v[j]+v[l];
				if(ump.find(s-nr)!=ump.end())
				{
					fout<<v[i]<<" "<<v[j]<<" "<<v[l]<<" "<<ump[s-nr].f<<" "<<ump[s-nr].s<<" "<<ump[s-nr].t<<"\n";
					return 0;
				}
			}
	fout<<-1<<"\n";
}