#include <cstdio>
#include <algorithm>
using namespace std;

#define NMAX 101

int i, N, S, ind = 1;
int v[NMAX];
int j, k, l, m, n;

int main() {
	freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	scanf("%i%i", &N, &S);
	for (i = 1; i <= N; ++i)
		scanf("%i", &v[i]);
	for (i = 1; i <= N; ++i)
		for (j = 1; j <= N; ++i)
			for (k = 1; k <= N; ++k)
				for (l = 1; l <= N; ++l)
					for (m = 1; m <= N; ++m)
						for (n = 1; n <= N; ++n)
							if (v[i] + v[j] + v[k] + v[l] + v[m] + v[n] == S) {
								printf("%i %i %i %i %i %i\n", v[i], v[j], v[k], v[l], v[m], v[n]);
								return 0;
							}
	printf("-1\n");
	return 0;
}