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

using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
    int n, s, i, j, k, nr;
    vector<int> v;
    unordered_map<int, vector<int> > hashh;
    fin >> n >> s;
    for(i=0;i<n;++i)
    {
        fin >> nr;
        v.push_back(nr);
    }
    for(i = 0; i < n; i++)
    {
        for(j = i; j < n; j++)
        {
            for(k = j; k < n; k++)
            {
                nr = v[i] + v[j] + v[k];
                hashh[nr] = {v[i], v[j], v[k]};
                if(hashh.find(s-nr) != hashh.end())
                {
                    fout << v[i] << " " << v[j] << " " << v[k] << " " << hashh[s-nr][0] << " " << hashh[s-nr][1] << " " << hashh[s-nr][2];
                     return 0;
                }
            }
        }
    }
    fout <<-1;

    return 0;
}