#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<pair<char,char>,char > > > 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 l;
}

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);

	bool ok = 0;
	for(int i = 0;i<N;++i)
		for(int j = 0;j<N;++j)
			for(int k = 0;k<N;++k)
			{
				if(v[i] + v[j] + v[k]<S)
				{
				int pos = binary_search( S - v[i] - v[j] - v[k]);
				
				if(!sume.empty()) 
					{
						if(pos<sume.size())
						{
							l[0] = v[i] , l[1] = v[j] , l[2] = v[k];
							l[3] = v[sume[pos].nd.st.st] , l[4] = v[sume[pos].nd.st.nd] , l[5] = v[sume[pos].nd.nd];
							i = N + 1;
							ok = 1;
						}
						
						sume.insert(sume.begin() + pos,MP(v[i] + v[j] + v[k],MP(MP(i,j),k)));
					}
				else
				sume.push_back(MP(v[i] + v[j] + v[k],MP(MP(i,j),k)));
				}
			}

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