#include <fstream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

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

struct trei {
    int x, y, z;
};

int v[128], n, s;
bool found;
map<int, trei> m;
vector <int> sums;

void citire() {
    fin >> n >> s;
    for(int i = 1; i <= n; i++)
        fin >> v[i];
}

int cb(int st, int dr, int x) {
    if(dr >= st) {
        int m = (st+dr)/2;
        if(sums[m] == x)
            return m;
        else if(sums[m] > x)
            return cb(st, m-1, x);
        else
            return cb(m+1, dr, x);
    }
    return -1;
}

void solve() {
    for(int i = 1; i<= n; i++)
        for(int j = 1; j <= n; j++)
            for(int k = 1; k <= n; k++)
            if(m.find(v[i] + v[j] + v[k]) == m.end()) {
                m[v[i]+v[j]+v[k]] = {v[i], v[j], v[k]};
                sums.push_back(v[i]+v[j]+v[k]);
            }

    int l = sums.size();
    sort(sums.begin(), sums.end());

    for(int a = 0; a < l; a++) {
        int poz = cb(0, l, s-sums[a]);
        if(poz != -1) {
            found = true;
            fout << m[sums[a]].x << ' ' << m[sums[a]].y << ' ' << m[sums[a]].z << ' ' << m[sums[poz]].x << ' ' << m[sums[poz]].y << ' ' << m[sums[poz]].z;
            return;
        }
    }
}


int main() {
    citire();
    solve();
    if (!found) fout << -1;
}