#include <stdio.h>
#include <algorithm>
int v[105];
int d[7];
int main()
{
    freopen ( "loto.in" , "r" , stdin );
    freopen ( "loto.out" , "w" , stdout );
    int n , i , s , p;
    scanf ( "%d%d" , &n , &s );
    for ( i=1 ; i <= n ; i ++ )
    {
        scanf ( "%d" , &v[i] );
    }

    std::sort ( v + 1 , v + n + 1 );
    if ( 6 * v[n] < s )
    {
        printf ( "-1\n" );
        return 0;
    }
    int j,k,l,q;
    for(i=1;i<=n;i++)
      for(j=1;j<=n;j++)
         for(k=1;k<=n;k++)
             for(l=1;l<=n;l++)
                 for( p=1 ;p <= n ; p ++ )
                     for( q=1 ; q <= n; q ++ )
                        if (v[i]+v[j]+v[k]+v[l]+v[p]+v[q]==s)
                     {
                         printf ( "%d %d %d %d %d %d\n" , v[i] , v[j] , v[k] , v[l] , v[p] , v[q] );
                        return 0;
                     }
    return 0;
}