#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
using namespace std;
#define NMax 101
int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}
int main()
{
	FILE *f, *g;
	f = fopen("loto.in", "r");
	g = fopen("loto.out", "w");
	int n, s, v[NMax]; 
	fscanf(f, "%d %d", &n, &s);
	for (int i=0; i<n; i++)
		fscanf(f, "%d", &v[i]);
	qsort(v, n, sizeof(int), compare);
	for (int i=0; i<n; i++)
		for (int j = 0; j<n; j++)
			for (int z = 0; z<n; z++)
				if (s >= v[i] + v[j] + v[z])
					for (int l = 0; l<n; l++)
						for (int k = 0; k<n; k++)
							for (int h = 0; h<n; h++)
								if (v[i] + v[j] + v[z] + v[l] + v[k] + v[h] == s)
								{
									fprintf (g, "%d %d %d %d %d %d", v[i], v[j], v[z], v[l], v[k], v[h]);
									return 0;
								}
	fprintf(g, "-1");
	fclose(f); fclose(g);
	return 0;
}