#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;

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

short int n, i, j, k;
int s, x, poz, v[105];
unordered_map <int, pair <int, pair <int, int> > > fr;
bool ok;

int main()
{
    fin >> n >> s;
    for (i = 1; i <= n; i ++)
    {
        fin >> v[i];
    }
    for (i = 1; i <= n && !ok; i ++)
    {
        for (j = i; j <= n && !ok; j ++)
        {
            for (k = j; k <= n && !ok; k ++)
            {
                poz = v[i] + v[j] + v[k];
                
                fr[poz].first = v[i];
                fr[poz].second.first = v[j];
                fr[poz].second.second = v[k];
                
                poz = s- v[i] - v[j] - v[k];
                if (fr[poz].first != 0)
                {
                    fout << v[i] << ' ' << v[j] << ' ' << v[k] <<' ';
                    fout <<fr[poz].first << ' ' << fr[poz].second.first << ' ' << fr[poz].second.second;
                    ok = 1;
                }
            }
        }
    }
    if (ok == 0) {fout<<"-1";}
    return 0;
}