#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
long s,a[102];
int n;

int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%d%ld",&n,&s);
for(int i=1;i<=n;i++)
	scanf("%ld",&a[i]);
sort(a+1,a+n+1);
if(6*a[n]>=s)
for(int i=n;i>=1;i--)
	for(int j=n;j>=1;j--)
		for(int k=n;k>=1;k--)
			for(int t=n;t>=1;t--)
				for(int x=n;x>=1;x--)
					for(int r=n;r>=1;r--)
						if(a[i]+a[j]+a[k]+a[t]+a[x]+a[r]==s)
						{	printf("%ld %ld %ld %ld %ld %ld",a[r],a[x],a[t],a[k],a[j],a[i]);
						    return 1;
						}
printf("-1");
return 1;
}