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

using namespace std;

ifstream f("loto.in");
ofstream o("loto.out");

int N, S, nr, s;
vector<int> v;
unordered_map<int, vector<int> > m;

int main()
{
    f >> N >> S;
    for(int i = 1; i <= N; i++)
    {
        f >> nr;
        v.push_back(nr);
    }

     for(int i = 0; i < v.size(); i++)
     {
         for(int j = i; j < v.size(); j++)
         {
             for(int k = j; k < v.size(); k++)
             {
                 s = v[i] + v[j] + v[k];
                 m[s] ={v[i], v[j], v[k]};
                if(m.find(S - s) != m.end())
                {
                    g << v[i] << " " << v[j] << " " << v[k] << " ";
                    vector<int> vec2 = m[S - s];
                    g << vec2[0] << " " << vec2[1] << " " << vec2[2] << " ";
                    return 0;
                }
            }
        }
    }

    g << -1;

    return 0;

}