#include<iostream>
#include<fstream>
#include<unordered_map>
#include<array>
using namespace std;
struct numere {
	int x;
	int y;
	int z;
	
};
int n, s, i, v[101], j, z, ok = -1;
int main() {
	fstream f("loto.in");
	ofstream g("loto.out");
	unordered_map<int,numere >map;
	f >> n >> s;
	for (i = 0; i < n; i++)
		f >> v[i]; 
	for(i=0;i<n;i++)
		for(j=i;j<n;j++)
			for(z=j;z<n;z++)
			{
				numere nr;
				nr.x = v[i];
				nr.y = v[j];
				nr.z = v[z];
				map[v[i] + v[j] + v[z]] = nr;
				if (map.find(s - v[i] - v[j] - v[z]) != map.end()) {
					ok = 1;
					g << map[v[i] + v[j] + v[z]].x <<" " <<map[v[i] + v[j] + v[z]].y <<" "<< map[v[i] + v[j] + v[z]].z <<" "<< map[s - v[i] - v[j] - v[z]].x <<" "<<map[s - v[i] - v[j] - v[z]].y <<" "<<map[s - v[i] - v[j] - v[z]].z;
				}
				if (ok == 1)
					return 0;
			}
	cout << -1;
	return 0;
}