#include <bits/stdc++.h>
using namespace std;

struct bas
{
    int a, b, c, ch;
};

int v[105];
unordered_map<int, bas> mp;

int main()
{
    ifstream f("loto.in");
    ofstream g("loto.out");
    int n, s;
    f >> n >> s;
    for (int i = 1; i <= n; i ++)
    {
        f >> v[i];
    }
    sort(v + 1, v + n + 1);
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            for (int k = 1; k <= n; k ++)
            {
                mp[v[i] + v[j] + v[k]] = {v[i], v[j], v[k], 1};
            }
        }
    }
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            for (int k = 1; k <= n; k ++)
            {
                if (mp[s - (v[i] + v[j] + v[k])].ch == 1)
                {
                    g << mp[s - (v[i] + v[j] + v[k])].a << ' ' << mp[s - (v[i] + v[j] + v[k])].b << ' ' << mp[s - (v[i] + v[j] + v[k])].c << ' ' << v[i] << ' ' << v[j] << ' ' << v[k] << '\n';
                    return 0;
                }
            }
        }
    }
    g << -1;
    f.close();
    g.close();
}