#include <bits/stdc++.h>
using namespace std;
#define int long long
ifstream in ("loto.in");
ofstream out ("loto.out");
int v[101];
struct point {
	int x1, x2, x3;
};
map <int, point> fr;
main ()
{
	int n, kk;
	in >> n >> kk;
	for (int i = 1;i<=n;++i)
		in >> v[i];
	for (int i = 1;i<=n;++i)
		for (int j = 1;j<=n;++j)
			for (int k = 1;k<=n;++k)
			{
				int sum = v[i] + v[j] + v[k];
				point P = {v[i], v[j], v[k]};
				fr[sum] = P;
			}
	for (int i = 1;i<=n;++i)
		for (int j = 1;j<=n;++j)
			for (int k = 1;k<=n;++k)
			{
				int sum = v[i] + v[j] + v[k];
				int left = kk - sum;
				if (fr.find(left) != fr.end())
				{
					out << v[i] << ' ' << v[j] << ' ' << v[k] << ' ' << fr[left].x1 << ' ' << fr[left].x2 << ' ' << fr[left].x3;
					return 0;
				}
			}
	cout << -1;
	return 0;
}