#include <bits/stdc++.h>
using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");
#define LLI long long int

int main()
{
    int n, target;
    fin >> n >> target;

    vector<int> vec(n + 1);
    unordered_map<int, tuple<int, int, int>> sumMap;
    for (int i = 1; i <= n; i++)
        fin >> vec[i];

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
            {
                int tempSum = vec[i] + vec[j] + vec[k];
                sumMap[tempSum] = make_tuple(vec[i], vec[j], vec[k]);
            }

    for (auto &[tempSum, elem] : sumMap)
    {
        int rem = target - tempSum;
        if (sumMap.contains(rem))
        {
            fout << get<0>(elem) << " " << get<1>(elem) << " " << get<2>(elem) << " "
                 << get<0>(sumMap[rem]) << " " << get<1>(sumMap[rem]) << " " << get<1>(sumMap[rem]);
            return 0;
        }
    }

    fout << "-1";
    return 0;
}