/***************************************************
 * Alex Palcuie
 * Romania - 2013
 * alex [dot] palcuie [at] gmail [dot] com
 * http://palcu.blogspot.com/
****************************************************/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iterator>
#include <cstring>
#include <climits>
#include <fstream>
#include <sstream>

using namespace std;

// Defines
#define NAME(n) #n
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define F first
#define S second
#define pb push_back
#define sz size()
#define mp make_pair
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

// Helpers
template <typename T> inline void dbv(const T * v, const char * name, int n){
	fprintf(stderr, "=== %s ===\n", name);
	for(int i=0; i<n; i++)
		cerr << v[i] << " ";
	cerr << '\n';
}
template<typename T> void dbw(const std::vector<T>& t, const char * name){
	fprintf(stderr, "=== %s ===\n", name);
	unsigned n = t.size();
	for(typename std::vector<T>::size_type i=0; i<n; ++i)
		std::cerr << t[i] << ' ';
	cerr << '\n';
}

// Structs
struct Sume{
    int s;
    int v[3];
};

// Constants
const int N = 128;
const int INF = 0x3f3f3f3f;

// Globals
int n, s, v[N];
Sume sume[N * N * N];

// Functions
bool operator < (Sume a, Sume b){
    return a.s < b.s;
}
int main(){
	#ifndef ONLINE_JUDGE
	freopen("loto.in", "r", stdin);
	freopen("loto.out", "w", stdout);
	#endif

	int i, j, k, it;
	cin >> n >> s;
	for(i=0; i<n; i++)
        cin >> v[i];

	it = 0;
	for(i=0; i<n; i++)
        for(j=0; j<n; j++)
            for(k=0; k<n; k++){
                sume[it].s = v[i] + v[j] + v[k];
                sume[it].v[0] = i;
                sume[it].v[1] = j;
                sume[it].v[2] = k;
                it++;
            }

	sort(sume, sume+n*n*n);
    for(i=0; i<it; i++)
        if(sume[i].s == sume[i-1].s)
            continue;
        if(sume[i].s > s)
            break;
        else{
            int sumToSearch = s - sume[i].s;
            int left = i, right = n*n*n-1, mid;
            bool ok = false;
            while(left<=right){
                mid = left + (right-left)/2;
                int suma = sume[mid].s;
                if(suma == sumToSearch){
                    ok=true;
                    break;
                }
                else{
                    if(suma < sumToSearch)
                        right = mid-1;
                    else
                        left = mid+1;
                }
            }
            if(ok){
                for(j=0; j<3; j++)
                    cout << v[sume[i].v[j]] << " ";
                for(j=0; j<3; j++)
                    cout << v[sume[mid].v[j]] << " ";
                exit(0);
            }
        }

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