#include<cstdio>
#include<algorithm>
using namespace std;
int sume[1000000],a[110],i,j,n,k,l,u,s;
int cautare(int val)
{
int st=1,dr=u,m;
while(st<=dr)
	{
		m=(st+dr)/2;
		if(sume[m]==val)
			return 1;
		if(val>sume[m])
			st=m+1;
		else
			dr=m-1;
			
	}
	if(sume[m]==val) return 1;
	return 0;
}
int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%d%d",&n,&s);
for(i=1;i<=n;i++)
	scanf("%d",&a[i]);
	for(i=1;i<=n;i++)
		for(j=i;j<=n;j++)
			for(k=j;k<=n;k++)
				sume[++u]=a[i]+a[j]+a[k];
sort(sume+1,sume+u+1);
for(int ind=1;ind<=n;ind++)
	if(cautare(s-sume[ind]))
	{
		for(i=1;i<=n;i++)
			for(j=i;j<=n;j++)
				for(k=j;k<=n;k++)
					if(sume[ind]==a[i]+a[j]+a[k]) printf("%d %d %d",a[i],a[j],a[k]);
				
		for(i=1;i<=n;i++)
			for(j=i;j<=n;j++)
				for(k=j;k<=n;k++)
					if(a[i]+a[j]+a[k]==s-sume[ind]) printf(" %d %d %d",a[i],a[j],a[k]);
				return 0;
	
	}

return 0;
}