#include <bits/stdc++.h>

using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int n,s,a[110],q,p;
struct loto
{
    int val,n1,n2,n3;
}v[1000010];
bool cmp(loto a ,loto b)
{
    return a.val<b.val;
}
int cb(int s,int l,int r)
{
    if(l>r) return 0;
    int m=l+(r-l)/2;
    if(v[m].val==s) return m;
    if(s<v[m].val) return cb(s,l,m-1);
    else return cb(s,m+1,r);
}
int main()
{
     in>>n>>s;
     for(int i=1;i<=n;i++) in>>a[i];
     for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
         for(int k=1;k<=n;k++)
           {
               v[++q].val=a[i]+a[j]+a[k];
               v[q].n1=a[i];
               v[q].n2=a[j];
               v[q].n3=a[k];
           }
     sort(v+1,v+q+1,cmp);
     for(int i=1;i<=q;i++)
     {
         if(s-v[i].val<0) break;
         p=cb(s-v[i].val,1,q+1);
        if(p) {
              out<<v[i].n1<<" "<<v[i].n2<<" "<<v[i].n3<<" "<<v[p].n1<<" "<<v[p].n2<<" "<<v[p].n3;
              return 0;
             }

     }
     out<<-1;
}