#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	int n,s,i,a[105],sch=0,i1,i2,i3,i4,i5,i6,sol=0;
	scanf("%d%d",&n,&s);
	for (i=1; i<=n; i++)
		scanf("%d",&a[i]);
	sort(a+1, a+n+1);
	for (i1=n; i1>=1; i1--)
	{
		if (sol==1)
			break;
		for (i2=n; i2>=1; i2--)
		{
			if (sol==1)
				break;
			for (i3=n; i3>=1; i3--)
			{
				if (sol==1)
					break;
				for (i4=n; i4>=1; i4--)
				{
					if (sol==1)
						break;
					for (i5=n; i5>=1; i5--)
					{
						if (sol==1)
							break;
						for (i6=n; i6>=1; i6--)
							if (a[i1]+a[i2]+a[i3]+a[i4]+a[i5]+a[i6]==s)
							{
								sol=1;
								printf("%d %d %d %d %d %d",a[i1],a[i2],a[i3],a[i4],a[i5],a[i6]);
								break;
							}
					}
				}
			}
		}
	}
	if (sol==0)
		printf("-1");
	return 0;
}