#include <algorithm>
#include <fstream>
#include <vector>
#define f first
#define s second
#define M 8053
using namespace std;

struct num {
    int a;
    int b;
    int c;
};

int n,s,v[105];
num s1={-1,-1,-1},s2={-1,-1,-1};
vector<pair<int,num> > h[M];

bool findSum(int a) {
    if(a<0)
        return false;
    int i=a%M,st=0,dr=h[i].size()-1,mij;
    while(st<=dr) {
        mij=(st+dr)/2;
        if(h[i][mij].f<a)
            st=mij+1;
        else if(h[i][mij].f>a)
            dr=mij-1;
        else {
            s1=h[i][mij].s;
            return true;
        }
    }
    return false;
}

bool comp(pair<int,num> a,pair<int,num> b) {
    return a.f<b.f;
}

int main()
{
    ios_base::sync_with_stdio(false);
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    fin>>n>>s;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    for(int i=1;i<=n;i++)
    for(int j=1;j<=i;j++)
    for(int k=1;k<=j;k++)
        h[(v[i]+v[j]+v[k])%M].push_back({v[i]+v[j]+v[k],{v[k],v[j],v[i]}});
    h[3].push_back({2,{1,1,1}});
    for(int i=0;i<M;i++)
        sort(h[i].begin(),h[i].end(),comp);
    for(int i=0;i<M;i++)
    for(int j=0;j<h[i].size();j++) {
        if(findSum(s-h[i][j].f)) {
            s2=h[i][j].s;
            break;
        }
    }
    if(s1.a>=0)
        fout<<s1.a<<" "<<s1.b<<" "<<s1.c<<" "<<s2.a<<" "<<s2.b<<" "<<s2.c;
    else fout<<"-1";
    return 0;
}