#include <iostream>
#include <fstream>
#include <map>
#include <vector>

const int MAXN = 100 + 5;

using namespace std;

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

int n,v[MAXN],sum;
map<int,bool>exista;
map<int,pair<int,pair<int,int> > >mapa;

int main()
{
    in.tie(NULL);
    out.tie(NULL);
    ios::sync_with_stdio(false);

    in>>n>>sum;
    for(register int i = 1; i <= n; ++i)
        in>>v[i];
    register int s;
    for(register int i = 1; i <= n; ++i){
        for(register int j = 1; j <= n; ++j){
            for(register int k = 1; k <= n; ++k){
                s = v[i] + v[j] + v[k];
                if(!exista[s]){
                    exista[s] = true;
                    mapa[s].first = v[i];
                    mapa[s].second.first = v[j];
                    mapa[s].second.second = v[k];
                }
            }
        }
    }
    for(register int i = 1; i <= n; ++i){
        for(register int j = 1; j <= n; ++j){
            for(register int k = 1; k <= n; ++k){
                s = v[i] + v[j] + v[k];
                if(exista[sum - s]){
                    s = sum - s;
                    out<<mapa[s].first<<" "<<mapa[s].second.first<<" "<<mapa[s].second.second<<" "<<v[i]<<" "<<v[j]<<" "<<v[k];
                    return 0;
                }
            }
        }
    }
    out<<-1;
    return 0;
}