#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;

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

struct triplet{
    int a,b,c;
};

unordered_map<int, triplet> M;

void Do(){
    int n,s,x, sum,ct = 0;
    triplet t;
    vector<int>v;
    fin >> n >> s;
    for(int i = 0; i<n; ++i){
        fin >> x;
        v.push_back(x);
    }
    for(int i = 0; i<n; ++i)
        for(int j = 0; j<n; ++j)
            for(int k = 0; k<n; ++k){
                sum = v[i] + v[j] + v[k];
                t.a = v[i];
                t.b = v[j];
                t.c = v[k];
                if(M.find(sum) != M.end())
                    continue;
                else M[sum] = t;
            }
    for(int i = 0; i<n; ++i)
        for(int j = 0; j<n; ++j)
            for(int k = 0; k<n; ++k){
                sum = v[i] + v[j] + v[k];
                if(M.find(s-sum) != M.end() && ct == 0){
                    ct ++;
                    fout << v[i] <<" "<<v[j] <<" "<<v[k] << " " << M[s-sum].a << " " << M[s-sum].b << " " << M[s-sum].c;

                }
            }
    if(ct == 0)
        fout << -1;
}

int main()
{
    Do();
    return 0;
}