#include <iostream>
#include <unordered_map>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");

int main()
{
    int n, s, x, sum, ok=0;
    unordered_map<int, vector<int> > m;
    vector<int> v;

    fin >> n >> s;
    for(int i = 1; i <= n; i++){
        fin >> x;
        v.push_back(x);
    }

    for(int i = 0; i < v.size(); i++){
        for(int j = 0; j < v.size(); j++){
            for(int k = 0; k < v.size(); k++){
                sum = v[i] + v[j] + v[k];
                m[sum] ={v[i], v[j], v[k]};
            }
        }
    }


    for(int i = 0; i < v.size(); i++)
    {
        for(int j = 0; j < v.size(); j++)
        {
            for(int k = 0; k < v.size() && !ok; k++)
            {
                sum = v[i] + v[j] + v[k];
                if(m.find(s - sum) != m.end())
                {
                    fout << v[i] << " " << v[j] << " " << v[k] << " ";
                    vector<int> x = m[s - sum];
                    fout << x[0] << " " << x[1] << " " << x[2] << " ";
                    ok=1;
                }
            }
        }
    }
    if (!ok)
        fout << -1;
    return 0;

}