#include <bits/stdc++.h>
#include <unordered_map>

using namespace std ;

ifstream fin ("loto.in") ;
ofstream fout ("loto.out") ;

struct trei
{
    int a, b, c ;
} t ;

unordered_map <int, trei> w ;
unordered_map <int, trei> :: iterator d ;
int n, v [ 101 ], m, s ;
pair<int, trei> aux ;

int main ( )
{
    fin >> n >> s ;

    for ( int i = 0 ; i < n ; i ++ )
    {
        fin >> v [ i ] ;
    }

    for ( int i = 0 ; i < n ; i ++ )
    {
        for ( int j = 0 ; j < n ; j ++ )
        {
            for ( int q = 0 ; q < n ; q ++ )
            {
                t . a = v [ i ] ;
                t . b = v [ j ] ;
                t . c = v [ q ] ;

                aux = make_pair ( t.a + t.b + t.c, t ) ;
                w . insert ( aux ) ;
            }
        }
    }

    for ( auto it = w . begin ( ) ; it != w . end ( ) ; it ++ )
    {
        m = s - it->first ;
        d = w . find ( m ) ;
        
        if ( d != w . end ( ) )
        { 
            fout << (it->second).a << " " << (it->second).b << " " << (it->second).c << " " << (d->second).a << " " << (d->second).b << " " << (d->second).c << " " ;
            return 0 ;
        }
    }

    return 0 ;
}