#include<stdio.h>
#include<algorithm>
using namespace std;
int u,a[105],sums[1000005];
bool bs(int val)
{
	int st=1,dr=u,med;
	while(st<=dr)
	{
		med=(st+dr)/2;
		if(sums[med]==val)
			return 1;
		else
			if(sums[med]>val)
				dr=med-1;
			else
				st=med+1;
	}
	return 0;
}
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	int ok,indice,n,i,j,k,s,p,q,r;
	scanf("%d",&n);scanf("%d",&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[++u]=a[i]+a[j]+a[k];
	sort(sums+1,sums+u+1);
	for(indice=1;indice<=u;indice++)
		if(bs(s-sums[indice]))
			{
				ok=0;
				for(i=1;i<=n;i++)
					{
					for(j=1;j<=n;j++)
						{
						for(k=1;k<=n;k++)
							if(a[i]+a[j]+a[k]==sums[indice])
							{
								ok=1;
								break;
							}
						if(ok==1)
							break;
						}
					if(ok==1)
						break;
					}
				for(p=1;p<=n;p++)
					for(q=1;q<=n;q++)
						for(r=1;r<=n;r++)
							if(sums[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;
}