#include <fstream>
#include<unordered_map>

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

    for (i = 0; i < n ; i++) {
        fileIn >> v[i];
    }
    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, {i,j,k}});
                    }
                if (multime.find(suma-t)!= multime.end()) {
                    tuplu1 = (*multime.find(suma-t)).second;
                    fileOut << v[i] << ' '<<v[j] << ' '<< v[k] << ' ';
                    fileOut << v[std::get<0>(tuplu1)] << ' '<< v[std::get<1>(tuplu1)] << ' '<< v[std::get<2>(tuplu1)];
                    return 0;
                }
            }

    fileOut << -1;
    return 0;
}