#include<stdio.h>
#include<algorithm>
using namespace std;
int n,i,i1,i2,i3,sum,S,v[1000],p,u,aux,m,k,j;
struct qq
{
	int a;
	int b;
	int c;
	int s;
};
qq elem[1000001];
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	scanf("%d%d",&n,&sum);
	for(i=1;i<=n;i++)
		scanf("%d",&v[i]);
	for(i=1;i<=n;i++)
		for(i1=1;i1<=n;i1++)
			for(i2=1;i2<=n;i2++)
			{
				if(v[i]+v[i1]+v[i2]<=sum)
				{
				elem[++k].s=v[i]+v[i1]+v[i2];
				elem[k].a=v[i];
				elem[k].b=v[i1];
				elem[k].c=v[i2];
				}
			}
	for(i=1;i<=k;i++)
	{
		for(j=k;j>=1;j--)
		{
			if(elem[i].s+elem[j].s==sum)
			{
				printf("%d %d %d %d %d %d",elem[i].a,elem[i].b,elem[i].c,elem[j].a,elem[j].b,elem[j].c);
				return 0;
			}
		}
	}
	printf("%d",-1);
			return 0;
}