#include <bits/stdc++.h>

using namespace std;

map <int, vector<int> > fv;
int v[101];
int main(int argc, char const *argv[])
{
	ifstream fin ("loto.in");
	ofstream fout ("loto.out");
	int n, s;
	fin >> n >> s;
	for (int i = 1; i<=n; ++i)
		fin >> v[i];
	for (int i = 1; i<=n; ++i)
		for (int j = i; j<=n; ++j)
			for (int k = j; k<=n; ++k)
			{
				int sum = v[i]+v[j]+v[k];
				if (fv.count(sum) == 0)
				{
					fv[sum].push_back(v[i]);
					fv[sum].push_back(v[j]);
					fv[sum].push_back(v[k]);
				}
				if (fv.count(s - sum) != 0)
				{
					for (auto x:fv[sum])
						fout << x << ' ';
					for (auto x:fv[s - sum])
						fout << x << ' ';
					return 0;
				}
			}
	fout << "-1";
	return 0;
}