// https://www.infoarena.ro/problema/loto

#include <fstream>
#include <unordered_map>
using namespace std;

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

struct numbers
{
	int one;
	int two;
	int three;
};

int v[105];
unordered_map <int, numbers> fr;

int main()
{
	int n, s;
	fin >> n >> s;
	for (int i = 1; i <= n; i ++)
		fin >> v[i];
	bool ok = false;
	for (int i = 1; i <= n && !ok; i ++)
		for (int j = i; j <= n && !ok; j ++)
			for (int k = j; k <= n && !ok; k ++)
			{
				int pos = v[i] + v[j] + v[k];
				fr[pos].one = v[i];
				fr[pos].two = v[j];
				fr[pos].three = v[k];
				pos = s - pos;
				if (fr.count(pos))
				{
					fout << v[i] << ' ' << v[j] << ' ' << v[k] <<' ';
					fout << fr[pos].one << ' ' << fr[pos].two << ' ' << fr[pos].three;
					ok = true;
				}
			}
	if (!ok)
		fout << -1;
	return 0;
}