#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ("loto.in"); ofstream g ("loto.out");
struct tip
{   ll x,y,z,suma;
};
bool cmp(tip a,tip b)
{
    return a.suma<b.suma;
}
vector <tip> sume;
ll v[105];
int main()
{   ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,s;
    f>>n>>s;
    for(int i=1;i<=n;i++) f>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int k=j;k<=n;k++) sume.push_back( { v[i],v[j],v[k],v[i]+v[j]+v[k]} );
    sort(sume.begin(),sume.end(),cmp);
    for(int i=0;i<sume.size();i++)
    {   int st=1,dr=sume.size();
        while(st<=dr)
        {   int mij=(st+dr)>>1;
            if(sume[mij].suma+sume[i].suma==s)
            {   g<<sume[i].x<< " "<<sume[i].y<< " "<<sume[i].z<< " ";
                g<<sume[mij].x<< " "<<sume[mij].y<< " "<<sume[mij].z<< " ";
                return 0;
            }
            if(sume[mij].suma<s-sume[i].suma) st=mij+1;
            else dr=mij-1;
        }
    }
    g<<-1;
    return 0;
}