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

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

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

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

bool cmp(trei a, trei b) {
    return a.sum < b.sum;
}

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

/*int cb(int st, int dr, int x) {
    while(dr >= st) {
        int m = (st+dr)/2;
        if(sums[m] == x)
            return m;
        else if(sums[m] > x)
            dr = m-1;
        else
            st = m+1;
    }
    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++)
                sums.push_back({v[i], v[j], v[k], v[i]+v[j]+v[k]});

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

    int a = 0, b = l-1;
    while(a <= b) {
        if(sums[a].sum+sums[b].sum == s) {
            found = true;
            fout << sums[a].x << ' ' << sums[a].y << ' ' << sums[a].z << ' ' << sums[b].x << ' ' << sums[b].y << ' ' << sums[b].z;
            return;
        } else if(sums[a].sum + sums[b].sum < s)
            a++;
        else
            b--;
    }

    //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;
}