#include <fstream>
#include <algorithm>

using namespace std;
int n,i,j,k;
long s,v[100],l[6],sl;

int main()
{
	ifstream inFile("loto.in");
	inFile >> n >> s;
	for (i=0; i<n; i++)
		inFile >> v[i];
	inFile.close();
	if (v[n-1]*6<s)
	{
		ofstream outFile("loto.out");
		outFile << -1 << '\n';
		outFile.close();
	}
	else
		if (v[n-1]*6==s)
		{
			ofstream outFile("loto.out");
			outFile << v[n-1] << " " << v[n-1] << " " << v[n-1] << " " << v[n-1] << " " << v[n-1] << " " << v[n-1] << '\n';
			outFile.close();
		}
		else
		{
			sort(v,v+n);
			sl=0; k=1; j=n-k;
			for (i=0; i<6; i++)
			{
				l[i]=v[j];
				sl+=l[i];
				if (sl>=s && i!=5)
				{
					sl-=l[i];
					i--; j--;
					if (j==-1)
					{
						i--;
						k++; sl-=l[i];
						j=n-k;
					}
				}
			}
			ofstream outFile("loto.out");
			for (i=5; i>=0; i--)
				outFile << l[i] << " ";
			outFile << '\n';
			outFile.close();
		}
	return 0;
}