#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

int n, s;
vector<int> v;
vector<int> val;
int cauta_binar(int, int, int);
void afiseaza(int);
ifstream f("loto.in");
ofstream g("loto.out");

int main(){

	f>>n;
	f>>s;
	val = vector<int> (n);
	
	for (int i=0; i<n; i++) {
		f>>val[i];
	}

	v = vector<int> (0);
	set<int> S;

	for (int i=0; i<n; i++)
		for (int j=0; j<n; j++)
			for (int k=0; k<n; k++)
				S.insert(val[i]+val[j]+val[k]);

	//sort(v.begin(), v.end());

	bool gasit = false;
	int sol = -1;
	int nn = v.size();

	set<int> :: iterator it1, it2;

	for (it1 = S.begin(); it1 != S.end(); ++it1) {
		it2 = S.find(s - *it1);
		if (it2 != S.end()) {
			afiseaza(*it1);
			afiseaza(*it2);
			gasit = true;
			break;
		}
	
	}

	if (!gasit)
		g<<"-1";

	f.close();
	g.close();
	return 0;
}

void afiseaza(int suma) {
	for (int i=0; i<n; i++)
		for (int j=0; j<n; j++)
			for (int k=0; k<n; k++)
				if ((val[i] + val[j] + val[k]) == suma) {
					g << val[i] << ' ' << val[j] << ' ' << val[k] << ' ';
					return;
				}
	return;
}