#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int a,b,i,j,k,m,n,an,bn,cn,w[200],l,sol,v[1000005];
int main()
{
    f>>a>>b;
    for (i=1;i<=a;++i)
    f>>w[i];
    for (i=1;i<=a;++i)
    for (j=1;j<=a;++j)
    for (k=1;k<=a;++k)
    v[++l]=w[i]+w[j]+w[k];
    sort(v+1,v+a+1);

for (i=1;i<=l;++i)
    if(binary_search(v+1,v+a+1,b-(v[i])))
    {
    sol=v[i];
    break;
    }
if (sol)
{
    for (i=1;i<=a;++i)
    for (j=1;j<=a;++j)
    for (k=1;k<=a;++k)
    if (w[i]+w[j]+w[k]==sol)
    {
        g<<w[i]<<" "<<w[j]<<" "<<w[k]<<" ";
        i+=a;j+=a;k+=a;
    }

    for (i=1;i<=a;++i)
    for (j=1;j<=a;++j)
    for (k=1;k<=a;++k)
    if (w[i]+w[j]+w[k]==b-sol)
    {
        g<<w[i]<<" "<<w[j]<<" "<<w[k]<<" ";
        i+=a;j+=a;k+=a;
    }
    g<<'\n';

    return 0;
}
    g<<"-1\n";
    return 0;
}