#include <iostream>
#include <fstream>
#include <unordered_map>
#include <tuple>
#include <vector>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
    int n, S, dif;
    tuple<int, int, int>tuplu;
    unordered_map<int, tuple<int,int,int>>dict(1000001);

    fin >> n >> S;
    vector <int> v(n+1);
    for(int i = 0; i < n; i++)
        fin >> v[i];
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
                dict[v[i]+v[j]+v[k]] = make_tuple(v[i], v[j], v[k]);

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
                {
		dif = S-v[i]-v[j]-v[k];
		if(dict.find(dif) != dict.end())
                	{
			tuplu = dict[dif];
                    	fout << get<0>tuplu << " " << get<1>tuplu << " " << get<2>tuplu << " " << v[i] << " " << v[j] << " " << v[k];
                    	return 0;
                	}
		}
    
    fout << -1;

    return 0;
}