#include <bits/stdc++.h>
#pragma GCC optimize("03")

using namespace std;

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

int n, s, a[110], st[1000010], vf;
map <int, vector <int> > mp;

int main(){
	in >> n >> s;
	for(int i = 1; i <= n; i++)
		in >> a[i];
	sort(a + 1, a + n + 1);
	for(int i = 1; i <= n; i++)
		for(int j = i; j <= n; j++)
			for(int k = j; k <= n; k++){
				int sum = a[i] + a[j] + a[k];
				if(mp.count(sum))	
					continue;
				mp[sum] = {a[i], a[j], a[k]};
				st[++vf] = sum;
			}
	for(int i = 1; i <= vf; i++)
		if(mp.count(s - st[i])){
			for(auto it : mp[st[i]])
				out << it << ' ';
			for(auto it : mp[s - st[i]])
				out << it << ' ';
			return 0;
		}
	out << -1;
	return 0;
}