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

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

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

vector <int> fck;
vector <sol> fin;
const int NMAX = 103;
int caca[NMAX];
int main()
{
    int n, s, i;
    cin >> n >> s;
    for (i = 1; i <= n; i++)
        cin >> caca[i];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
            {
                fck.push_back(caca[i] + caca[j] + caca[k]);
                sol a;
                a.x = caca[i];
                a.y = caca[j];
                a.z = caca[k];
                fin.push_back(a);
            }
    sort(fck.begin(), fck.end());
    int p1, p2;
    p1 = -1;
    for (int i = 0; i < fck.size(); i++)
    {
        int val = s - fck[i];
        int st = 0, dr = fck.size(), rez = -1;
        bool ok = 0;
        while (st <= dr)
        {
            int med = ((st + dr) >> 1);
            if (fck[med] == val)
            {
                rez = med;
                ok = 1;
                break;
            }
            else if (fck[med] > val)
                dr = med - 1;
            else
                st = med + 1;
        }
        if (ok)
        {
            p1 = i;
            p2 = rez;
            break;
        }
    }
    if (p1 == -1)
        cout << -1;
    else
        cout << fin[p1].x << " " << fin[p1].y << " " << fin[p1].z  << " "
             << fin[p2].x << " " << fin[p2].y << " " << fin[p2].z;
}