#include <bits/stdc++.h>
using namespace std;

int main() {
	freopen("loto.in", "r", stdin);
	freopen("loto.out", "w", stdout);
	int n, s;
	cin >> n >> s;
	vector<int> v(n);
	for(int i = 0;i < n;++i)
		cin >> v[i];
	unordered_map<int, vector<int>> mp;
	for(int i = 0;i < n;++i)
		for(int j = 0;j < n;++j)
			for(int k = 0;k < n;++k)
			{
				int sum = v[i] + v[j] + v[k];
				if(mp.find(sum) == mp.end())
					mp[sum] = {v[i], v[j], v[k]};
			}
	for(int i = 0;i < n;++i)
		for(int j = 0;j < n;++j)
			for(int k = 0;k < n;++k)
			{
				int sum = v[i] + v[j] + v[k];
				if(sum <= s && mp.find(s - sum) != mp.end())
				{
					vector<int>& tmp = mp[s - sum];
					cout << v[i] << " " << v[j] << " " << v[k] << " " << tmp[0] << " " << tmp[1] << " " << tmp[2]
					    << "\n";
					return 0;
				}
			}
	cout << "-1\n";
}