#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;

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

int main() {
    int n, s;
    fin >> n >> s;
    unordered_map<int, pair<int, pair<int, int>>> m; // sum -> (i, (j, k))
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        fin >> v[i];
    }

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                int sum = v[i] + v[j] + v[k];
                if (m.find(sum) == m.end()) {
                    m[sum] = {i, {j, k}};
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                int sum = v[i] + v[j] + v[k];
                if (m.find(s - sum) != m.end()) {
                    auto [a, p] = m[s - sum];
                    int b = p.first, c = p.second;
                    if (a != i && a != j && a != k && b != i && b != j && b != k && c != i && c != j && c != k) {
                        fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ' << v[a] << ' ' << v[b] << ' ' << v[c];
                        return 0;
                    }
                }
            }
        }
    }

    fout << "-1";
}