#include <bits/stdc++.h>

using namespace std;

ifstream f("loto.in");
ofstream g("loto.out");

const int NMAX = 105;
int n, S, a[NMAX];
map<int, vector<int>> mp;

int main(){
    f >> n >> S;
    for(int i = 1; i <= n; ++i){
        f >> a[i];
    }
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            for(int k = 1; k <= n; ++k){
                mp[a[i] + a[j] + a[k]] = {a[i], a[j], a[k]};
            }
        }
    }
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            for(int k = 1; k <= n; ++k){
                int s = a[i] + a[j] + a[k];
                if(mp.find(S - s) != mp.end()){
                    vector<int> sol = mp[S - s];
                    g << sol[0] << " " << sol[1] << " " << sol[2] << " " << a[i] << " " << a[j] << " " << a[k];
                    return 0;
                }
            }
        }
    }
    g << -1;
    return 0;
}