#include <bits/stdc++.h>

using namespace std;
ifstream fin("loto.in");
ofstream gout("loto.out");

int n, s, v[105];
int i, j, k;
unordered_map <int, pair<int, int>> hash_table;

int main()
{
    fin >> n >> s;
    for(int t = 0 ; t < n ; ++t)
        fin >> v[t];

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

    for (i = 0 ; i < n ; ++i)
        for (j = i ; j < n ; ++j)
            for (k = j ; k < n ; ++k)
            {
                if (hash_table.find(s - v[i] - v[j] - v[k]) != hash_table.end())
                {
                    gout << v[i] << " " << v[j] << " " << v[k] << " " << hash_table[s - v[i] - v[j] - v[k]].first << " "
                            << hash_table[s - v[i] - v[j] - v[k]].second << " " << s - v[i] - v[j] - v[k] -
                                hash_table[s - v[i] - v[j] - v[k]].first - hash_table[s - v[i] - v[j] - v[k]].second;
                    return 0;
                }
            }
    gout << -1;
    return 0;
}