#include<bits/stdc++.h>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,S,a[101],ki=0,mij,sol=-1,val;
struct talent
{
    int x, y, z;
    int sum;
} sume[1000001];

bool cmp(talent a, talent b)
{
    return a.sum<b.sum;
}

int main()
{
    f>>n>>S;

    for(int i=1;i<=n;i++)
        f>>a[i];

    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int k=j;k<=n;k++)
            {
                sume[ki].sum = a[i]+a[j]+a[k];
                sume[ki].x = a[i];
                sume[ki].y = a[j];
                sume[ki].z = a[k];
                ki++;
            }

    sort(sume,sume+ki,cmp);

    bool ok = 0;
    for(int i=0;i<ki;i++)
    {
        val=S-sume[i].sum;
        int st=0,dr=ki-1,mij,sol=-1;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            if(sume[mij].sum==val){sol=mij;break;}
            else if(sume[mij].sum<val)st=mij+1;
            else if(sume[mij].sum>val)dr=mij-1;
        }
        if(sol>=0)
        {
            ok = 1;
            g << sume[i].x << " " << sume[i].y << " " << sume[i].z << " ";
            g << sume[sol].x << " " << sume[sol].y << " " << sume[sol].z;
            break;
        }
    }
    if(!ok)
        g << -1;
    return 0;
}