#include <fstream>
#include <unordered_map>
int v[100];
int suma, t, n, i, j, k;
std::ifstream fileIn("loto.in");
std::ofstream fileOut("loto.out");
std::unordered_map<int, std::tuple<int,int,int>> multime;

bool solve() {
    for(i = 0; i < n; ++i)
        for (j = 0; j < n; ++j)
            for (k = 0; k < n; ++k) {
                t = v[i] + v[j] + v[k];
                if (t < suma) {
                    multime.insert({t, {v[i],v[j],v[k]}});
                    if (multime.find(suma-t)!= multime.end()) {
                        fileOut << v[i] << ' '<< v[j] << ' '<< v[k] << ' ';
                        fileOut << std::get<0>(multime[suma-t])<< ' '<< std::get<1>(multime[suma-t]) << ' '<< std::get<2>(multime[suma-t])<<'\n';
                        return true;
                    }
            }
        }
return false;
}

int main() {

    fileIn >> n >> suma;
    for (i = 0; i < n ; ++i) {
        fileIn >> v[i];
    }
    if (solve()== false) {
    fileOut << -1 <<'\n';
    }

    return 0;
}