#include<cstdio>
#include<algorithm>
using namespace std;

int x[101],n,m,s;
struct suma{
	int sum,t1,t2,t3;
};
suma a[338355];

bool cmp(suma x,suma y)
{
	return x.sum<y.sum;
}
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	scanf("%d %d",&n,&s);
	
	for(int i=1;i<=n;++i)
		scanf("%d",&x[i]);
	
	for(int i=1;i<=n;++i)
			for(int j=i;j<=n;++j)
				for(int k=j;k<=n;++k)
				{
					a[++m].sum=x[i]+x[j]+x[k];
					a[m].t1=i;a[m].t2=j;a[m].t3=k;
				}
	
	sort(a+1,a+m+1,cmp);
	
	for(int i=1;i<=m;++i)
	{
		int termen=s-a[i].sum;
		if(termen>=0)
		{
			int st=1,dr=m,mij=0;
			while(st<=dr)
			{
				mij=(st+dr)/2;
				if(a[mij].sum<termen)
						st=mij+1;
				else
					if(a[mij].sum>termen)
						dr=mij-1;
					else
					{
						printf("%d %d %d %d %d %d",x[a[i].t1],x[a[i].t2],x[a[i].t3],x[a[mij].t1],x[a[mij].t2],x[a[mij].t3]);
						return 0;
					}
			}
		}
	}
	printf("-1");
	return 0;
}