#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int u,a[105];
vector<int> sums;
bool search(int a)
{
	int n=sums.size(),i,pas;
	for(pas=1;pas<n;pas<<=1);
	for(i=0;pas;pas>>=1)
		if(i+pas<n && a>=sums[i+pas])
			i+=pas;
	return a==sums[i];
}
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	int ok,n,i,j,k,s,p,q,r;
	scanf("%d%d",&n,&s);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(k=1;k<=n;k++)
				sums.push_back(a[i]+a[j]+a[k]);
	sort(sums.begin(),sums.end());
	for(vector<int>::iterator indice=sums.begin();indice!=sums.end();indice++)
		if(search(s-*indice))
			{
				ok=0;
				for(i=1;i<=n;i++)
					{
					for(j=i;j<=n;j++)
						{
						for(k=j;k<=n;k++)
							if(a[i]+a[j]+a[k]==*indice)
							{
								ok=1;
								break;
							}
						if(ok==1)
							break;
						}
					if(ok==1)
						break;
					}
				for(p=1;p<=n;p++)
					for(q=p;q<=n;q++)
						for(r=q;r<=n;r++)
							if(*indice+a[p]+a[q]+a[r]==s)
							{
								printf("%d %d %d %d %d %d\n",a[i],a[j],a[k],a[p],a[q],a[r]);
								return 0;
							}
				}
	printf("-1\n");
	return 0;
}