#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int n, s, v[100000], ok;

int main()
{
    fin >> n >> s;
    for(int i = 1; i <= n; i++)
        fin >> v[i];
    sort(v + 1, v + n + 1);
    if(s > 6 * v[n])
        fout << -1;
    else
    {
        for(int i1 = 1; i1 <= n; i1++)
            for(int i2 = 1; i2 <= n; i2++)
                for(int i3 = 1; i3 <= n; i3++)
                    for(int i4 = 1; i4 <= n; i4++)
                        for(int i5 = 1; i5 <= n; i5++)
                            for(int i6 = 1; i6 <= n; i6++)
                                if(v[i1] + v[i2] + v[i3] + v[i4] + v[i5] + v[i6] == s)
                                {
                                    fout << v[i1] << " " << v[i2] << " " << v[i3] << " " << v[i4] << " " << v[i5] << " " << v[i6];
                                    ok = 1;
                                }
        if(!ok)
            fout << -1;
    }
    return 0;
}