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

using namespace std;

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

int main()
{
    int N;
    long long S, x;
    fin >> N >> S;

    vector<long long> loto(N);
    for (int i = 0; i < N; i++)
    {
        fin >> x;
        loto[i] = x;
    }
    fin.close();

    unordered_map<long long, vector<long long>> solve;
    bool found = false;

    for (int i = 0; i < N && !found; i++)
    {
        for (int j = 0; j < N && !found; j++)
        {
            for (int k = 0; k < N && !found; k++)
            {
                long long sum = loto[i] + loto[j] + loto[k];
                solve[sum] = {loto[i], loto[j], loto[k]};
                long long minus = S - sum;

                if (solve.count(minus) && solve[minus][0] != loto[i] && solve[minus][0] != loto[j] && solve[minus][0] != loto[k] &&
                    solve[minus][1] != loto[i] && solve[minus][1] != loto[j] && solve[minus][1] != loto[k] &&
                    solve[minus][2] != loto[i] && solve[minus][2] != loto[j] && solve[minus][2] != loto[k])
                {
                    found = true;
                    fout << loto[i] << " " << loto[j] << " " << loto[k] << " " << solve[minus][0] << " " << solve[minus][1] << " " << solve[minus][2];
                }
            }
        }
    }

    if (!found)
        fout << -1;

    fout.close();

    return 0;
}