#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
typedef struct tip {unsigned long i,j,k,val;}TIP;
unsigned long a[101],poz=0;
TIP b[1000010];
unsigned long n,s;
unsigned long k[7];
bool ret(TIP a,TIP b)
{
    return a.val<b.val;
}
int main()
{
    fin>>n>>s;
    for (unsigned long i=1;i<=n;i++)
        fin>>a[i];
    for (unsigned long i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            for (int k=1;k<=n;k++)
    {
        b[++poz].val=a[i]+a[j]+a[k];
        b[poz].i=i;
        b[poz].j=j;
        b[poz].k=k;
    }
    sort(b+1,b+(n*n*n)+1,ret);
            bool ok=1;
    for (unsigned long i=1;i<=n*n*n;i++)
    {
        unsigned long st=i+1;
        unsigned long dr=n*n*n;
        unsigned long mij;
        while (st<=dr)
        {
            mij=(st+dr)/2;
            if (b[mij].val==s-b[i].val)
            {
            k[1]=a[b[i].i];
            k[2]=a[b[i].j];
            k[3]=a[b[i].k];
            k[4]=a[b[mij].i];
            k[5]=a[b[mij].j];
            k[6]=a[b[mij].k];
            ok=0;
            break;
            }
            else
            {
                if (b[mij].val<s-b[i].val)
                    dr=mij-1;
                else
                    st=mij+1;
            }
        }
        if (ok==0)
            break;
    }
    if (ok==1)
        fout<<-1;
        else
        {
            sort(k+1,k+7);
            for (int i=1;i<=6;i++)
                fout<<k[i]<<' ';
        }
    return 0;
}