#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");

int n, s, aux;
vector<int> a;
struct p{int x,y,z;};
unordered_map<int, p> m;
int main(){

    in>>n>>s;
    for(int i=0;i<n;++i){
        in>>aux;
        a.push_back(aux);
    }
    for(int i=0;i<a.size();++i){
        for(int j=i;j<a.size();++j){
            for(int k=j;k<a.size();++k){
                m[a[i]+a[j]+a[k]]={a[i],a[j],a[k]};
            }
        }
    }
    for(auto i:m){
        unordered_map<int, p>::iterator it=m.find(s-i.first);
        if(it!=m.end()){
            out<<i.second.x<<" "<<i.second.y<<" "<<i.second.z<<" "<<it->second.x<<" "<<it->second.y<<" "<<it->second.z;
            return 0;
        }
    }
    out<<"-1";
}