# include <stdio.h>
# include <vector>
using namespace std;
typedef struct {int b,c,d;} etc;
const int mod= 666013;
etc t;
vector <etc> v[mod +5];
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];
				if (p>s)
				{
				x=s%mod;
				ok = false;
				t.b=a[i]; t.c=a[j]; t.d=a[k];
				for (int q=0; q< v[x].size(); ++q)
					if (v[x][q].d+v[x][q].b+v[x][q].c == s){
                      ok = true ;
                      break;
					}					  
			    if (ok==false){
				v[x].push_back(t);
				break;}
				}
			}
    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%mod;
				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;
}