/*
am fost cretin ca am uitat sa sortez sumele .. destul de mult timp >.>
la hash nu mi-a trebuit asta, dar acolo daca aveam suma totala - curenta negativa nu verificam :(
*/


#include <cstdio>
#include <algorithm>
using namespace std;

    typedef struct { long val,E[3]; } numar;
    numar Nr[1000005];

    long nr,n,i,j,l,s,T[101],st,dr;

bool mysort ( numar a, numar b )
{
    return a.val<b.val;
}

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 ", &T[i]);
    for ( i=1; i<=n; i++ )
        for ( j=i; j<=n; j++ )
            for ( l=j; l<=n; l++ )
            {
                Nr[++nr].val=T[i]+T[j]+T[l];
                Nr[nr].E[0]=T[i];
                Nr[nr].E[1]=T[j];
                Nr[nr].E[2]=T[l];
            }
    st=1;
    dr=nr;
    sort ( Nr+1, Nr+nr+1, mysort );
    while ( st<=dr )
    {
        if ( (Nr[st].val + Nr[dr].val) == s )
        {
            printf ("%d %d %d %d %d %d\n", Nr[st].E[0], Nr[st].E[1], Nr[st].E[2], Nr[dr].E[0], Nr[dr].E[1], Nr[dr].E[2]);
            return 0;
        }
        if ( ( Nr[st].val + Nr[dr].val ) > s )
            dr--;
        else
            st++;
    }
    printf ("-1\n");
    return 0;
}