#include <cstdio>
#include <algorithm>

using namespace std;
int n,s,i,j,k,a[101],m;
bool gasit;
struct sum
{
    int suma,nr1,nr2,nr3;
};
sum suma[1000000];

int main()
{
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    scanf("%d%d",&n,&s);
    for (i=1; i<=n; i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    if ((a[1]*n>s) or (a[n]*n<s)) printf("-1");
    else
    {
        gasit=false;
    m=0;
    for (i=1; i<=n; i++)
    for (j=1; j<=n; j++)
    for (k=1; k<=n; k++)
    {
        m++;
        suma[m].suma=a[i]+a[j]+a[k];
        suma[m].nr1=a[i];
        suma[m].nr2=a[j];
        suma[m].nr3=a[k];
    }
    for (i=1; i<=n*n*n; i++)
    {
        for (j=i; j<=n*n*n; j++)
        if (suma[i].suma+suma[j].suma==s)
        {printf("%d %d %d %d %d %d",suma[i].nr1,suma[i].nr2,suma[i].nr3,suma[j].nr1,suma[j].nr2,suma[j].nr3); i=n*n*n+10; j=n*n*n+10; gasit=true;}
    }
    if (gasit==false) printf("-1");
    }
    return 0;
}