#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int n, s;
vector<int> v;
vector<int> val;
int cauta_binar(int, int, int);
int 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);

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

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

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

	for (int i=0; i<nn && !gasit; i++) {
		sol = cauta_binar(i, nn, s-v[i]);
		if (sol != -1) gasit = true;
	}

	if (!gasit)
		g<<"-1";
	else {
		int afis;
		afis = afiseaza(v[sol]);
		afis = afiseaza(s - v[sol]);
	}

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

int cauta_binar(int inc, int fin, int valoare) {
	int index = -1;
	while (inc <= fin) { 
		int m = (inc + fin)/2;
		if (v[m] == valoare)
			return m;
		else
			if (valoare < v[m])
				inc = m + 1;
			else
				fin = m -1;
	}
	return index;
}

int 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 1;
				}
	return 0;
}