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

using namespace std;

int n, s;
vector<int> v;
vector<int> val;
int cauta_binar(int inc, int fin, int valoare);

int main(){
	ifstream f("loto.in");
	ofstream g("loto.out");

	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/2 && !gasit; i++) {
		sol = cauta_binar(i, nn, s-v[i]);
		if (sol != -1) gasit = true;
	}

	if (!gasit)
		g<<"-1";
	else {
		bool g1 = false, g2 = false;
		for (int i=0; i<n && (!g1 || !g2); i++)
		for (int j=0; j<n && (!g1 || !g2); j++)
			for (int k=0; k<n && (!g1 || !g2); k++) {
				int aux = val[i]+val[j]+val[k];
				if(aux == v[sol] && !g1) {
					g1 = true;
					g << val[i] << ' ' << val[j] << ' ' << val[k] << ' ';
				}
				if (aux == s - v[sol] && !g2) {
					g2 = true;
					g << val[i] << ' ' << val[j] << ' ' << val[k] << ' ';
				}

			}
	}

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

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