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

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

struct halfSum
{
	int a;
	int b;
	int c;
};

unordered_map<int, halfSum> semiSume;
int v[100], n, s;

int main()
{
	halfSum ob;
	fin >> n >> s;

	for (int i = 0; i < n; i++)
		fin >> v[i];

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			for (int k = 0; k < n; k++)
			{
				ob.a = v[i];
				ob.b = v[j];
				ob.c = v[k];

				int suma = v[i] + v[j] + v[k];
				semiSume.insert({ suma, ob });

				if (semiSume.find(s - suma) != semiSume.end())
				{
					fout << semiSume[suma].a << " " << semiSume[suma].b << " " << semiSume[suma].c << " " << semiSume[s - suma].a << " " << semiSume[s - suma].b << " " << semiSume[s - suma].c;
					return 0;
				}
			}

	fout << -1;
}