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

int n,s,v[105];
pair<int,int> s1,s2,s3;
vector<pair<int,pair<int,int> > > h[M];

bool findSum(int a) {
    if(a<0)
        return false;
    int i=a%M,st=0,dr=h[i].size(),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 {
            s3={h[i][mij].s.f,h[i][mij].s.s};
            return true;
        }
    }
    return false;
}

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 j=1;j<=i;j++)
            h[(v[i]+v[j])%M].push_back({v[i]+v[j],{v[j],v[i]}});
    }
    for(int i=0;i<M;i++)
        sort(h[i].begin(),h[i].end());
    for(int i=0;i<M;i++)
    for(int j=0;j<h[i].size();j++) {
        for(int ii=0;ii<=i;ii++)
        for(int jj=0;jj<h[ii].size();jj++)
            if(findSum(s-h[i][j].f-h[ii][jj].f)) {
                s1={h[i][j].s.f,h[i][j].s.s},s2={h[ii][jj].s.f,h[ii][jj].s.s};
                break;
            }
    }
    if(s1.f>0)
        fout<<s1.f<<" "<<s1.s<<" "<<s2.f<<" "<<s2.s<<" "<<s3.f<<" "<<s3.s;
    else fout<<"-1";
    return 0;
}