#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=110;
int n,s;
int v[MAXN];
void read()
{
	FILE *fin=fopen("loto.in","r");
	fscanf(fin,"%d%d",&n,&s);
	for (int i=1; i<=n; ++i)
		fscanf(fin,"%d",&v[i]);
	fclose(fin);
}
int binary_search(int low, int high, int value)
{
	int mid;
	while (low<=high)
	{
		mid=(low+high)/2;
		if (v[mid]==value)
			return mid;
		else if (value<v[mid])
			high=mid-1;
		else if (value>v[mid])
			low=mid+1;
	}
	return 0;
}
void solve()
{
	FILE *fout=fopen("loto.out","w");

	int i,j,k,l,m,o;
	for (i=1; i<=n; ++i)
	{
		for (j=1; j<=n; ++j)
		{
			for (k=1; k<=n; ++k)
			{
				for (l=1; l<=n; ++l)
				{
					for (m=1; m<=n; ++m)
					{
						for (o=1; o<=n; ++o)
						{
							if (v[i]+v[j]+v[k]+v[l]+v[m]+v[o]==s)
							{
								fprintf(fout,"%d %d %d %d %d %d\n",v[i],v[j],v[k],v[l],v[m],v[o]);
								fclose(fout);
								return;
							}
						}
					}
				}
			}
		}
	}
	fprintf(fout,"-1\n");
	fclose(fout);
}
void write()
{

}
int main()
{
	read();
	sort(v+1,v+n+1);
	solve();
	return 0;
}