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

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

unordered_map<int,tuple<int,int,int>>m;

int n,s,v[101];

int main() {
    in>>n>>s;
    for(int i=0;i<n;i++)
        in >> v[i];
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            for(int k=0;k<n;k++)
                m[v[i]+v[j]+v[k]]={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 val=s-v[i]-v[j]-v[k];
                if (m.find(val) != m.end()) {
                    tuple<int,int,int> t = m[val];
                    out << v[get<0>(t)] << " " << v[get<1>(t)] << " " << v[get<2>(t)] << " " << v[i] << " " << v[j]
                        << " " << v[k];
                    return 0;
                }
            }
    out<<-1;
    return 0;
}