#include<bits/stdc++.h>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");

map <int, tuple <int, int, int>> half;
tuple <int, int, int> sol;
int n, v[105], loto;

int main()
{
    in>>n>>loto;
    for (int i = 0; i < n; i++)
        in >> v[i];

    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++)
            for (int t = j; t < n; t++)
                half[v[i] + v[j] + v[t]] = make_tuple(v[i], v[j], v[t]);

    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++)
            for (int t = j; t < n; t++)
            {
                long s = loto - (v[i] + v[j] + v[t]);
                if (half.find(s) != half.end())
                {
                    sol = half[s];
                    out <<get<0>(sol)<<' '<<get<1>(sol)<<' '<<get<2>(sol)<<' '
                        <<v[i]<<' '<<v[j]<<' ' <<v[t]<<endl;
                    return 0;
                }
            }
    out << "-1";
    return 0;
}