#include<stdio.h>
#include<algorithm>

using namespace std;

int main()
{
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);

	int a[101],i,j,k,l,m,o,n;
	long S;

	scanf("%d %d", &n, &S);

	for(i = 1; i<= n; i++)
		scanf("%d",&a[i]);

	sort(a+1,a+n+1);

	for( i = n; i >= 1; i--)
	   for( j = n; j >= 1; j--)
	      for( k = n; k >= 1; k--)
		 for( l = n; l >= 1; l--)
		    for( m = n; m >= 1; m--)
		       for( o = n; o >= 1; o--)
			  if(a[i] + a[j] + a[k] + a[l] + a[m] + a[o] == S)
			     printf("%d %d %d %d %d %d\n",a[i], a[j], a[k], a[l], a[m], a[o]),sol++;

	if(sol == 0)
		printf("-1");

	return 0;
}