#include <fstream>
#include <iostream>
#include <cstring>
#include <unordered_map>
#include <map>

using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
map<int, bool> mp;
struct {int a, b, c;} el[1000005];
int v[105], n, s, sums[1000005], m;

int main()
{
    f >> n >> s;
    for (int i = 1; i <= n; i++) f >> v[i];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
            {
                if(!mp[v[i] + v[j] + v[k]]) sums[++m] = v[i] + v[j] + v[k], mp[sums[m]] = 1, el[m] = {v[i], v[j], v[k]};
            }
    int poz, poz2, ok = 0;
    for (int i = 1; i <= m; i++) if(mp[s - sums[i]]) poz = i, i = m + 1, ok = 1;
    if(!ok)
    {
        g << -1 << '\n';
        return 0;
    }
    g << el[poz].a << ' ' << el[poz].b << ' ' << el[poz].c << ' ';
    poz2 = 1;
    while(sums[poz2] != s - sums[poz]) poz2++;
    g << el[poz2].a << ' ' << el[poz2].b << ' ' << el[poz2].c << ' ';
    return 0;
}