#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <cstdlib>
#include <algorithm>
using namespace std;

int n, s;
vector<int> numere;

int main (int argc, char const *argv[])
{
	ifstream in ("loto.in");
	in >> n >> s;
	numere.resize (n);
	for (int i = 0; i < n; i++)
		in >> numere[i];
	in.close ();
	
	sort (numere.begin (), numere.end ());
	
	ofstream out ("loto.out");
	for (int a = 0; a < n; a++)
	for (int b = 0; b < n; b++)
	for (int c = 0; c < n; c++)
	for (int d = 0; d < n; d++)
	for (int e = 0; e < n; e++)
	for (int f = 0; f < n; f++)
	if (numere[a] + numere[b] + numere[c] + numere[d] + numere[e] + numere[f] == s)
	{
		out << numere[a] << ' ' << numere[b] << ' ' << numere[c] << ' '
			<< numere[d] << ' ' << numere[e] << ' ' << numere[f] << '\n';
		out.close ();
		exit (0);
	}
	out << -1 << '\n';
	out.close ();
	
	return 0;
}