#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>

using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");

int n, s, x, sum;
unordered_map<int, vector<int> > m;
vector<int> v;

int main()
{


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

    for(int i = 0; i < v.size(); i++)
    {
        for(int j = i; j < v.size(); j++)
        {
            for(int k = j; k < v.size(); k++)
            {
                sum = v[i] + v[j] + v[k];
                m[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 << m[s - sum][0] << " " << m[s - sum][1] << " " << m[s - sum][2] << " ";
                    return 0;
                }
            }
        }
    }


    fout << -1;
    return 0;
}