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

struct T {
       int a, b, c;
};
unordered_map<int, T> um;
unordered_map<int, T>:: iterator it;
vector<int> v;

int main()
{
    int x, i, n, k, j, s, sum, p;
    bool ok;
    cin>>n>>s;
    for(i=0; i<n; i++){
       cin>>x;
       v.push_back(x);
    }
    for(i=0;i<n;i++){
       for(j=0;j<n;j++){
              for(k=0;k<n;k++){
                     sum=v[i]+v[j]+v[k];
                     um[sum]=T{ a[i], a[j], a[k]};
              } ///retinem in un um[] cei 3 termeni
       }
    }
    it=um.begin();
    while(it!=v.end()){
       p=um.find(s- it->first);
       if(p!=um.end()){ // ? nr trebuie in ordine cresc? nu stiu
             cout<<it->second.a<<" "<<it->second.b<<" "<<it->second.c<<" ";
             cout<<p.second.a<<" "<<p.second.b<<" "<<p.second.c<<endl;
             return 0;
       }
       it++;
    }
    cout<<-1;
    return 0;
}