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

using namespace std;

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

vector<int>a;

struct ind{
    int i1, i2, i3;
};

int n, s;
unordered_map<int,ind>sume;

int main()
{
    fin >> n >> s;
    for(int i = 0; i < n; i++)
    {
        int cit;
        fin >> cit;
        a.push_back(cit);
    }
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
            {
                int suma_crt = a[i]+a[j]+a[k];
                sume[suma_crt] = {i, j, k};
            }
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
            {
                int suma_crt = a[i]+a[j]+a[k];
                int suma_ramasa = s-suma_crt;
                if(sume.count(suma_ramasa))
                {
                    fout << a[i] << " " << a[j] << " " << a[k] << " " << a[sume[suma_ramasa].i1] << " " << a[sume[suma_ramasa].i2] << " " << a[sume[suma_ramasa].i3];
                    return 0;
                }
            }
    fout << -1;
    return 0;
}