# include <stdio.h>
# include <vector>
using namespace std;
typedef struct {int b,c,d;} etc;
etc t;
vector <etc> v[1000007];
int n,i,j,k,s,x,y,nr,s1,s2,a[1100],p,n1;
bool ok,ok1,ok2;

int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	scanf("%d %d\n",&n,&p);
	n1=0;
	//prim(n1);
	for (i=1; i<=n; i++)
		scanf("%d ",&a[i]);
	if (n==1)
		if (a[1]*6==p) printf("%d %d %d %d %d %d\n",a[1],a[1],a[1],a[1],a[1],a[1]);
	else
		printf("-1\n");
	else
	{
	for (i=1; i<=n; i++)
		for (j=1; j<=n; j++)
			for (k=1; k<=n; k++)
			{
				s=a[i]+a[j]+a[k];
				x=s%1000007;
				t.b=a[i]; t.c=a[j]; t.d=a[k];
				v[x].push_back(t);
			}
    ok=false;
	nr=-1;
    for (i=1; i<=n; i++)
		for (j=1; j<=n; j++)
			for (k=1; k<=n; k++)
			{
				x=p-(a[i]+a[k]+a[j]);
				y=x%1000007;
				for ( vector <etc> :: iterator ix=v[y].begin(); ix!=v[y].end(); ++ix)
				if ((*ix).b+(*ix).c+(*ix).d==x) {ok=true; printf("%d %d %d %d %d %d\n",a[i],a[j],a[k],(*ix).b,(*ix).c,(*ix).d); return 0;} 
			}
	}
	if (ok==false) printf("%d\n",-1);
	return 0;
}