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

using namespace std;

int main()
{
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    int n, s;
    fin >> n >> s;
    vector<int> v(n);
    for (int i = 0; i < n; i++)
        fin >> v[i];
    unordered_map<int, vector<int>> m;
    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++)
            for (int k = j; k < n; k++)
            {
                int sum = v[i] + v[j] + v[k];
                m[sum] = {v[i], v[j], v[k]};
            }

    bool found = false;

    for (int k = n - 1; k >= 0 && !found; k--)
        for (int j = k; j >= 0 && !found; j--)
            for (int i = j; i >= 0 && !found; i--)
            {
                int sum = v[i] + v[j] + v[k];
                if (m.find(s - sum) != m.end() && (m[s - sum][0] != v[i] && m[s - sum][1] != v[j] && m[s - sum][2] != v[k])) {
                    vector<int> temp = {v[i], v[j], v[k], m[s - sum][0], m[s - sum][1], m[s - sum][2]};
                    sort(temp.begin(), temp.end());
                    fout << temp[0] << " " << temp[1] << " " << temp[2] << " " << temp[3] << " " << temp[4] << " " << temp[5];
                    found = true;
                    break;
                }
            }
    if (!found)
        fout << -1;
    fin.close();
    fout.close();

    return 0;
}