#include<iostream>
#include<fstream>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> v;
vector<int>::iterator it, jt, kt;
ifstream f("loto.in");
ofstream g("loto.out");

int r, n, S, a, nr;
struct suma{
int a, b, c;
};
vector<int> sum;
vector<int>::iterator ist, gasit, jst;
map<int, suma> m;
map<int, int> su;
map<int, int>::iterator imp;
void afisare(){
g<<m[imp->first].a<<' '<<m[imp->first].b<<' '<<m[imp->first].c<<' '<<m[S-(imp->first)].a<<' '<<m[S-(imp->first)].b<<' '<<m[S-(imp->first)].c<<'\n';
}
int main()
{
    f>>n>>S;
    for(int i=0; i<n; ++i){f>>a; v.push_back(a);}
    suma s1;
    for(it=v.begin(); it!=v.end(); ++it)
    for(jt=it; jt!=v.end(); ++jt)
    for(kt=jt; kt!=v.end(); ++kt){
    int y=*it+*jt+*kt;
    if(m[y].a||y>=S) continue;
    else{
    s1.a=*it; s1.b=*jt; s1.c=*kt;
    sum.push_back(y); su[y]=1; //cout<<y<<' ';
    m[y]=s1;}
    }
    //sort(sum.begin(), sum.end());
    for(imp=su.begin(); imp!=su.end(); ++imp){
        if(su[S-(imp->first)]){afisare(); g.close(); return 0;}

    }
    g<<"-1";
    g.close();
    return 0;
}