#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cassert>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <list>
#include <functional>
using namespace std;
typedef long long LL;

#ifdef INFOARENA
#define ProblemName "loto"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

#define MAXN 110
int v[MAXN], S, N;

typedef pair<int, int> duet;

struct triplet {
	int a, b, c;
	triplet(int a, int b, int c) : a(a), b(b), c(c) {}
	triplet() {}
};

map< int, duet > M2;
map< int, triplet > M3;

void solve() {
	for (const auto &it : M3) {
		int needed = S - it.first;
		if (!M3.count(needed)) continue;
		triplet t1 = it.second, t2 = M3[needed];
		printf("%d %d %d %d %d %d\n", t1.a, t1.b, t1.c, t2.a, t2.b, t2.c);
		return;
	}
	puts("-1");
}

int main() {
	assert(freopen(InFile, "r", stdin));
	assert(freopen(OuFile, "w", stdout));
	scanf("%d%d", &N, &S);
	for (int i = 0; i < N; ++i) {
		scanf("%d", &v[i]);
		for (int j = i; j >= 0; --j) {
			int s = v[i] + v[j];
			if (M2.count(s)) continue;
			M2[s] = make_pair(v[i], v[j]);
		}
	}
	for (int i = 0; i < N; ++i)
	for (const auto &it : M2) {
		int s = v[i] + it.first;
		if (M3.count(s)) continue;
		M3[s] = triplet(v[i], it.second.first, it.second.second);
	}
	solve();
	return 0;
}