#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define x first
#define y second
#define ll long long
using namespace std;

int cmp( pair < pair<ll,ll>, pair<ll,ll> > n, pair < pair<ll,ll>, pair<ll,ll> > m) {
	if(n.x.x < m.x.x) return 1;
	return 0;
}
	
int main() {
	ifstream f("loto.in");
	ofstream g("loto.out");
	
	long long n, s, i, j, k, l, begin, end, mid, suma;
	vector <ll> val;
	vector < pair < pair<ll,ll>, pair<ll,ll> > > v;
	bool gasit=0;
	
	
	f>>n>>s;
	for(i=1; i<=n; i++) {
		f>>k;
		val.push_back(k);
	}
	
	for(i=0; i<val.size(); i++) {
		for(j=i; j<val.size(); j++) {
			for(k=j; k<val.size(); k++) {
				v.push_back(make_pair( make_pair(val[i]+val[j]+val[k], val[i]), make_pair(val[j],val[k])));
				
			}
		}
	}
	
	sort(v.begin(), v.end(), cmp);
	
	
	for(i=0; i<val.size(); i++) {
		for(j=0; j<val.size(); j++) {
			for(k=0; k<val.size(); k++) {	
				if(!gasit) {
			
					suma = val[i] + val[j] + val[k];
	
					begin = -1;
					end = v.size();
					while(end-begin>1) {
						mid = begin + (end-begin)/2;
						if( suma + v[mid].x.x > s ) end = mid;
						else begin = mid;
					}
					if(v[begin].x.x + suma == s) end=begin;
					if(v[mid].x.x + suma == s) end=mid;
					
					if(v[end].x.x + suma == s) {
						g<<v[end].x.y<<" "<<v[end].y.x<<" "<<v[end].y.y<<" "<<val[i]<<" "<<val[j]<<" "<<val[k]<<"\n";
						gasit=1;
					}
				
				}
			}
		}
	}
	
	if(!gasit) g<<"-1\n";
	
	f.close();
	g.close();
	return 0;
}