#include<cstdio>
#include<algorithm>
using namespace std;
typedef struct{int x,y,z;}tr;
tr u[1000001];
int v[101],w[1000001];
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	int n,s,i1,i2,i3,k=0,ok=0;
	scanf("%d%d",&n,&s);
	for(i1=1;i1<=n;i1++)scanf("%d",&v[i1]);
	for(i1=1;i1<=n;i1++)for(i2=1;i2<=n;i2++)for(i3=1;i3<=n;i3++)if(v[i1]+v[i2]+v[i3]<s){u[++k].x=i1;u[k].y=i2;u[k].z=i3;w[k]=v[i1]+v[i2]+v[i3];}
	sort(w+1,w+k+1);
	i1=1;i2=k;
	while(i1<i2&&!ok)
	{
		if(w[i1]+w[i2]==s){ok=1;printf("%d %d %d %d %d %d",v[u[i1].x],v[u[i1].y],v[u[i1].z],v[u[i2].x],v[u[i2].y],v[u[i2].z]);}
		else if(w[i1]+w[i2]<s)i1=(i1+i2)/2+1;
		else i2=(i1+i2)/2-1;
	}
	if(!ok)printf("-1");
	return 0;
}