#include <unordered_map>
#include <fstream>
#include <iostream>

using namespace std;

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

const int Dim = 101;
int A[Dim],n,S;
struct str{
int a,b,c;
};
unordered_map < int, str > M;

int main() {

	fin >> n >> S;
	for ( int i = 1; i <= n; ++i)
		fin >> A[i];
	for ( int i = 1; i <= n; ++i)
		for ( int j = 1; j <= n; ++j)
			for ( int k = 1; k <= n; ++k) {
				int s = A[i] + A[j] + A[k];
				M[s] = {A[i],A[j],A[k]};
				if (M.find(S - s) != M.end() ) {
					fout << A[i] << " " << A[j] << " " << A[k]  << " " << M[S - s].a << " " << M[S - s].b << " " << M[S - s].c;
					return 0;
				}
			}
	fout << -1;
}