#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int i1,i2,i3,i4,i5,mij,li,ls,i,ok,s,S,n,a[101];
int main()
{f>>n>>S;
for(i=1;i<=n;++i)
	f>>a[i];
ok=1;
sort(a+1,a+n+1);
for(i1=1;i1<=n&&ok;++i1)
	for(i2=1;i2<=n&&ok;++i2)
		for(i3=1;i3<=n&&ok;++i3)
			for(i4=1;i4<=n&&ok;++i4)
				for(i5=1;i5<=n&&ok;++i5)
				{s=a[i1]+a[i2]+a[i3]+a[i4]+a[i5];
				li=1;
				ls=n;
				while(li<=ls)
				{mij=(li+ls)/2;
				if(a[mij]==S-s)
					break;
				else
					if(a[mij]+s<S)
						ls=mij-1;
					else
						li=mij+1;
				}
				if(a[mij]==S-s)
				{g<<a[i1]<<' '<<a[i2]<<' '<<a[i3]<<' '<<a[i4]<<' '<<a[i5]<<' '<<a[mij]<<'\n';
				ok=0;
				}
				}
if(i1>n)
	g<<"-1"<<'\n';
f.close();
g.close();
return 0;
}