#include<stdio.h>
#include<algorithm>
using namespace std;
struct valori{
	int s,a,b,c;
};
valori val[1001000];
int nr[110],x,sum;
int comp(const valori a,const valori b){
	return a.s<b.s?a.s:b.s;
}
void afis(int i,int j){
	printf("%d %d %d %d %d %d\n",val[i].a,val[i].b,val[i].c,val[j].a,val[j].b,val[j].c);
}	
void solve(){
	int i,j;
	for(i=0;i<x;++i){
		for(j=0;j<x;++j){
			if(val[i].s+val[j].s==sum){
				afis(i,j);
				return;
			}
		}
	}
	printf("-1\n");
	return;
}
int main(){
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	int n,i,j,k;
	scanf("%d%d",&n,&sum);
	for(i=0;i<n;++i)
		scanf("%d",&nr[i]);
	x=0;
	for(i=0;i<n;++i){
		for(j=0;j<n;++j){
			for(k=0;k<n;++k){
				val[x].s=nr[i]+nr[j]+nr[k];
				val[x].a=nr[i];
				val[x].b=nr[j];
				val[x].c=nr[k];
				++x;
			}
		}
	}
	sort(val,val+n,comp);
	
	solve();
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}