#include<bits/stdc++.h>
using namespace std;


struct sum{
    int a1,a2,a3;
};

unordered_map<int,sum>s;
int v[101];

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

int main() {


    int n,m;

    in>>n>>m;

    for(int i=0;i<n;++i){

        in>>v[i];
    }

    int rez;
    for(int i=0;i<n;++i){

        for(int j=i; j<n && v[i]<m; ++j){

            for(int k=j; k<n && v[i]+v[j]<m; ++k){

                rez=v[i]+v[j]+v[k];
                if(rez<m && s.count(rez)<=0){
                    s[rez].a1=v[i];
                    s[rez].a2=v[j];
                    s[rez].a3=v[k];
                    if(s.count(m-rez)>0){ out<<s[rez].a1<<" "<<s[rez].a2<<" "<<s[rez].a3<<" "<<s[m-rez].a1<<" "<<s[m-rez].a2<<" "<<s[m-rez].a3; return 0;}

                }
            }
        }
    }
    out<<-1;


    return 0;
}