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

using namespace std;

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

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

unordered_map<int,p> sume;
int a[101];

int main()
{
    int S,n;
    fin >> n >> S;
    for(int i = 0; i < n; ++i)
        fin >> a[i];
    for(int i = 0; i < n; ++i)
        for(int i2 = 0; i2 < n; ++i2)
            for(int i3 = 0; i3 < n; ++i3)
            {
                int sump = a[i]+a[i2]+a[i3];
                sume[sump] = {i, i2, i3};
            }

    for(int i = 0; i < n; ++i)
        for(int i2 = 0; i2 < n; ++i2)
            for(int i3 = 0; i3 < n; ++i3)
            {
                int sump = a[i]+a[i2]+a[i3];
                int sumc = S - sump;
                if(sume.count(sumc) != 0)
                {
                    fout << a[i] << " " << a[i2] << " " << a[i3] << " " << a[sume[sumc].i1] << " " << a[sume[sumc].i2] << " " << a[sume[sumc].i3];
                    return 0;
                }

            }
    fout << -1;
    return 0;
}