#include <cstdio>
#include <algorithm>
#include <vector>
#define st first
#define nd second
#define MP make_pair

using namespace std;

int S , N, v[101] ,l[6];
vector<pair<int, pair<short,short> > > sume;

int binary_search(int val)
{
	int l = 0 , r = sume.size() , m;
	while(l < r)
	{
		m = (l +r)>>1;
		if(sume[m].st == val) return m;
		if(sume[m].st > val)
			r = m - 1;
		else
			l = m + 1;
	}
	return -1;
}

int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	scanf("%d%d",&N,&S);
	for(int i=0;i<N;++i) 
		scanf("%d",&v[i]);
	sort(v,v+N);

	for(int i = 0;i<N;++i)
		for(int j = 0;j<N;++j)
			sume.push_back(MP(v[i]+v[j],MP(i,j)));
	sort(sume.begin(),sume.end());

	bool ok = 0;
	int ss = 0 , pos;
	for(int i = 0;i<N && !ok;++i)
		for(int j = 0;j<N;++j)
			for(int k = 0;k<N;++k)
				for(int x = 0;x<N;++x)
				{
					ss = v[i] + v[j] + v[k] + v[x];
					if( pos = binary_search(S-ss)!=-1) 
					{
						l[0] = v[i] , l[1] = v[j]  ,l[2] =v[k] , l[3] = v[x];
						l[4] = v[sume[pos].nd.st] , l[5] = v[sume[pos].nd.nd];
						ok = 1;
					}
				}

	if(ok) 
	{
	sort(l,l+6);
	for(int i=0;i<6;++i)
		printf("%d ",l[i]);
	}
	else
		printf("-1\n");
	return 0;
}