#include <iostream>
#include <fstream>
#include <unordered_map>
int n, S, v[100];

std::ifstream f("loto.in");
std::ofstream g("loto.out");
 
struct Info {
	int x, y, z;
	Info(int x=-1,int y=-1,int z=-1) : x(x), y(y), z(z) {}
};

std::unordered_map<int, Info> map;

int main() 
{
	f >> n >> S;
	 
	for (int i = 0; i < n; ++i)
		f >> v[i];
 
	for (int i = 0; i < n; ++i)
		for (int j = i; j < n; ++j)
			for (int k = j; k < n; ++k)
			{
				int sum3 = v[i] + v[j] + v[k];
				map[sum3] = Info(i,j,k);

				if (map.find(S-sum3) != map.end())
				{
					g << v[map[S-sum3].x] << ' ' << v[map[S - sum3].y] << ' ' << v[map[S - sum3].z] << ' ' << v[i] << ' ' << v[j] << ' ' << v[k];
					return 0;
				}
				
			}
	
	g << -1;
}