#include <iostream>
#include <queue>
#include <unordered_map>
#include <fstream>
using namespace std;

unordered_map<int, vector<vector<int>>> d;
ifstream fin("loto.in");
ofstream fout("loto.out");
vector<int> nums;
int n, sum;

void run() {
	for (int i = 0; i < nums.size(); i++) {
		for (int j = 0; j < nums.size(); j++) {
			for (int z = 0; z < nums.size(); z++) {
				int value = nums[i] + nums[j] + nums[z];
				vector<int> x;
				x.push_back(nums[i]);
				x.push_back(nums[j]);
				x.push_back(nums[z]);
				d[value].push_back(x);
				if (d[sum - value].size() != 0) {
					fout << nums[i] << ' ' << nums[j] << ' ' << nums[z] << ' ' << d[sum - value][0][0] << ' ' << d[sum - value][0][1] << ' ' << d[sum - value][0][2];
					return;
				}
			}

		}
	}
	fout << -1;
	return;
}
int main() {
	
	fin >> n;
	fin >> sum;


	for (int i = 0; i < n; i++) {
		int digit;
		fin >> digit;
		nums.push_back(digit);
	}

	run();

	return 0;
}