#include <fstream>
#include <unordered_map>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
typedef struct nod
{
    int i,j,k;
} tip;
unsigned long n,s,ii,jj,kk,a[1000],v[10],x;
int main()
{
    f>>n>>s;
    for(ii=1; ii<=n; ii++)
        f>>a[ii];
    unordered_map<unsigned long,tip> H;
    tip aux;
    for(ii=1; ii<=n; ii++)
        for(jj=1; jj<=n; jj++)
            for(kk=1; kk<=n; kk++)
            {
                aux.i=ii;
                aux.j=jj;
                aux.k=kk;
                H[a[ii]+a[jj]+a[kk]]=aux;
                if(H.count(s-a[ii]-a[jj]-a[kk])>0)
                {
                    aux=H[s-a[ii]-a[jj]-a[kk]];
                    v[1]=a[aux.i];
                    v[2]=a[aux.j];
                    v[3]=a[aux.k];
                    v[4]=a[ii];
                    v[5]=a[jj];
                    v[6]=a[kk];
                    sort(v+1,v+7);
                    for(x=1;x<=6;x++)
                        g<<v[x]<<" ";
                    return 0;
                }
            }
    g<<-1;

    return 0;
}