#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 101
using namespace std;
ifstream fin ("loto.in");
ofstream g ("loto.out");
int n, s, v[NMAX];
int main()
{
    fin>>n>>s;
    for (int i = 1; i <= n; i++)
        fin>>v[i];
    sort(v + 1, v + 1 + n);
    for (int a = 1; a <= n && v[a] * 6 <= s; a++)
        for (int b = a; b <= n && v[a] + v[b] * 5 <= s; b++)
            for (int c = b; c <= n && v[a]+v[b]+v[c]*4<=s;c++)
                for (int d = c; c<=n&&v[a]+v[b]+v[c]+v[d]*3<=s;d++)
                    for (int e=d;e<=n&&v[a]+v[b]+v[c]+v[d]+v[e]*2<=s;e++)
                        for (int f=e;f<=n&&v[a]+v[b]+v[c]+v[d]+v[e]+v[f]<=s;f++)
                            if (v[a]+v[b]+v[c]+v[d]+v[e]+v[f]==s) {
                                g<<v[a]<<' '<<v[b]<<' '<<v[c]<<' '<<v[d]<<' '<<v[e]<<' '<<v[f];
                                return 0;
                            }
    g<<-1;
    return 0;
}