#include <bits/stdc++.h>

using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");

struct elemente {
    int x, y, z;
};

int n, s, x, val;
vector<int> v;
unordered_map<int, elemente> sume;

int main() {

    fin >> n >> s;
    for (int i = 1; i <= n; i++) {
        fin >> x;
        v.push_back(x);
    }

    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++)
            for (int k = j; k < n; k++)
                sume[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};

    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++)
            for (int k = j; k < n; k++) {
                int val = s - (v[i] + v[j] + v[k]);
                if (sume.count(val) > 0) {
                    fout << v[i] << " " << v[j] << " " << v[k] << " " << sume[val].x << " " << sume[val].y << " "
                         << sume[val].z << '\n';
                    return 0;
                }
            }
    fout<<"-1";
    return 0;
}