#include <fstream>
#include <algorithm>
using namespace std;
long long v[1000],w[1000010];
int main()
{
	ifstream f("loto.in");
	ofstream g("loto.out");
	long long n,i,j,OK=0,x,k,q,t,m,OK2=0;
	long long S,S2;
	f>>n; f>>S; OK=0;
	for(i=1;i<=n;i++) f>>v[i];
	for(i=1;i<=n&&OK==0;i++)
	{	for(j=1;j<=n&&OK==0;j++)
		 { for(q=1;q<=n&&OK==0;q++)
			 { for(x=1;x<=n&&OK==0;x++)
				 { for(k=1;k<=n&&OK==0;k++)
					 { for(t=1;t<=n&&OK==0;t++)
						 { if(v[i]+v[j]+v[q]+v[x]+v[k]+v[t]==S) {g<<v[i]<<" "<<v[j]<<" "<<v[q]<<" "<<v[x]<<" "<<v[k]<<" "<<v[t]; OK=1;}
						 }
					 }
				 }
			 }
		 }
	}
	if(OK==0) g<<-1;
	f.close();
	g.close();
	return 0;
}