#include <iostream.h>
#include <fstream.h>
long long N,S,i,j,k,l,p,o,v[100];

int compare (const void *a, const void *b)
{
	return ( *(int*)a-*(int*)b );
}

int main()
{
	ifstream f("loto.in");
	ofstream g("loto.out");
	f>>N>>S;
	for (i=0;i<N;i++)
		f>>v[i];
	f.close();
	qsort (v,N,sizeof(int),compare);
	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 (p=N;p>=1;p--)
						for (o=N;o>=1;o--)
							if (v[i]+v[j]+v[k]+v[l]+v[p]+v[o]==S) 
								{
								g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[p]<<" "<<v[o]<<"\n";
								return 0;
								}
	g.close();
	return 0;
}