#include<fstream>
#include<unordered_map>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct AAA {
	int a, b, c;
};
int main() {
	int n, v[1002], i, s,j,k,x;
	bool h = true;
	unordered_map<int, AAA>m;
	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 (k = 1; k <= n; k++)
				m[v[i] + v[j] + v[k]] = { v[i],v[j],v[k] };
	for (i = 1; i <= n && h; i++)
		for (j = 1; j <= n&& h; j++)
			for (k = 1; k <= n&&h; k++) {
				x = s - v[i] - v[j] - v[k];
				if (m.count(x)) {
					fout << v[i] << " " << v[j] << " " << v[k] << " " << m[x].a << " " << m[x].b << " " << m[x].c;
					h = false;
					break;
				}
			}
	if (h)
		fout << -1;
}