#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
struct elem{int c;int p1,p2,p3;}v[1000001];int cmp(elem x,elem y){return x.c<y.c;}
int nr,n,s,a[101],i,j,k,st,dr,ok,mij;
int main()
{
    cin>>n>>s;
    for(i=1;i<=n;i++)
    cin>>a[i];
    nr=0;
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++)
            {
                nr++;
                v[nr].c=a[i]+a[j]+a[k];
                v[nr].p1=i;
                v[nr].p2=j;
                v[nr].p3=k;
            }
sort(v+1,v+nr+1,cmp);
ok=1;
for(i=1;i<=nr&&ok==1;i++){
    k=s-v[i].c;
    st=1;dr=nr;
    while(st<=dr)
        {
        mij=(st+dr)/2;
        if(k>v[mij].c)
            st=mij+1;
        else
            if(k<v[mij].c)
                dr=mij-1;
             else
               {
                   ok=0;
                   cout<<a[v[i].p1]<<" "<<a[v[i].p2]<<" "<<a[v[i].p3]<<" "<<a[v[mij].p1]<<" "<<a[v[mij].p2]<<" "<<a[v[mij].p3];
                    break;
               }
        }
    }
if(ok==1)
    cout<<-1;
    return 0;
}