#include <stdio.h>
#include <algorithm>
#include <map>
#include <vector>
#define MAX 105
using namespace std;

int n, s, v[MAX];
vector<int> l;
map<int, vector<int> > m;

int main(){
	freopen("loto.in", "r", stdin);
	freopen("loto.out", "w", stdout);
	scanf("%d%d", &n, &s);
	for(int i = 0; i < n; i++)
		scanf("%d", &v[i]);
	for(int i = 0; i < n; i++)
		for(int j = i; j < n; j++)
			for(int k = j; k < n; k++){
				int sum = v[i] + v[j] + v[k];
				l.push_back(sum);
				vector<int> x;
				x.push_back(v[i]);
				x.push_back(v[j]);
				x.push_back(v[k]);
				m[sum] = x;
			}

	sort(l.begin(), l.end());
	for(int i = 0; i < l.size() - 1; i++){
		if(l[i] > s / 2)
			break;
		int ref = s - l[i];
		int st = i, dr = l.size() - 1;
		while(st <= dr){
			int mid = st + (dr - st) / 2;
			if(l[mid] == ref){
				printf("%d %d %d %d %d %d\n", m[l[i]][0], m[l[i]][1], m[l[i]][2],
					m[l[mid]][0], m[l[mid]][1], m[l[mid]][2]);
				return 0;
			}
			if(l[mid] < ref)
				st = mid + 1;
			else
				dr = mid - 1;
		}
	}
	printf("-1\n");
	return 0;
}