#include <stdio.h>
#include <stdlib.h>
FILE *f=fopen("loto.in","r"), *g=fopen("loto.out","w");
int sort(const void *a, const void *b)
	{
	if (*(int*)a-*(int*)b>0) return -1;
	if (*(int*)a-*(int*)b==0) return 0;
	if (*(int*)a-*(int*)b<0) return 1;
        return 0;
	}
int main()
{
int p=1,n,i,j,k,l,m,o,x[101];
long s;
fscanf(f,"%d %ld",&n,&s);
for (i=1;i<=n;i++)
	fscanf(f,"%d",&x[i]);
i=n;
qsort(x,n+1,sizeof(x[0]),sort);
while ((i>=1)&&(p))
	{
	j=n;
	while ((j>=1)&&(p))
		{
		k=n;
		while ((k>=1)&&(p))
			{
			l=n;
			while ((l>=1)&&(p))
				{
				m=n;
				while ((m>=1)&&(p))
					{
					o=n;
					while ((o>=1)&&(p))
						{
						if (x[i]+x[j]+x[k]+x[l]+x[m]+x[o]==s) {
							p=0;
							fprintf(g,"%d %d %d %d %d %d\n",x[i],x[j],x[k],x[l],x[m],x[o]);
							}
						o--;

						}
					m--;
					}
				l--;
				}
			k--;
			}
		j--;
		}
	i--;
	}
if (p) fprintf(g,"-1\n");
fclose(g);
return 0;
}