#include <fstream>
#include <algorithm>
using namespace std;

#define dim 101
int v[dim];

int main()
{
	int i, j, k, l, m, n,o, s;
	ifstream fin("loto.in");
	ofstream fout("loto.out");
	
	fin>>n >>s;
	for(i=1;i<=n;++i)
		fin>>v[i];
	//sort(v,v+n+1);
	for(i=n;i>=1;--i)
		for(j=n;j>=1;--j)
			for(k=n;k>=1;--k)
				for(l=n;l>=1;--l)
					for(m=n;m>=1;--m)
						for(o=n;o>=1;--o)
							if(v[i]+v[j]+v[k]+v[m]+v[o]+v[l]==s)
								{fout<<v[i]<<" " <<v[j] <<" " <<v[k]<<" "<<v[l] <<" " <<v[m]<<" " <<v[o];return 0;}
	fout<<"-1";							
								
								return 0;
}