#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("loto.in"); ofstream out("loto.out");
int s, n, a[110], lg, k, i, j, p[10];
struct tss
{
	int a, b, c, s;
}v[1000010];
bool sortfnc(tss a, tss b)
{
	return a.s < b.s;
}
int main()
{
	in >> n >> s;
	for (i = 1; i <= n; ++i)
		in >> a[i];
	for (i = 1; i <= n; ++i)
		for (j = i; j <= n; ++j)
			for (k = j; k <= n; ++k)
			{
				v[++lg].a = a[i]; v[lg].b = a[j]; v[lg].c = a[k];
				v[lg].s = v[lg].a + v[lg].b + v[lg].c;
			}
	sort(v + 1, v + 1 + lg, sortfnc);
	i = 1; j = lg;
	while (i <= j)
	{
		if (v[i].s + v[j].s > s)
			j--;
		else if (v[i].s + v[j].s < s)
			i++;
		else
		{
			p[1] = v[i].a; p[2] = v[i].b; p[3] = v[i].c; p[4] = v[j].a; p[5] = v[j].b; p[6] = v[j].c;
			sort(p + 1, p + 7);
			for (i = 1; i <= 6; i++)
				out << p[i] << ' ';
			return 0;
		}
	}
	out << -1;
}