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

using namespace std;

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

int n, s;
short mx;
struct p_entry {
    int sum;
    short a, b, c;
};

inline bool operator< (p_entry &x, p_entry &y)
{
    return (x.sum < y.sum);
}

vector<short> v;
vector<p_entry> p;

int cautare_binara(int x, int st, int dr)
{
    if (st > dr) return -1;
    int mijl = (st + dr) / 2;
    if (p[mijl].sum == x) return mijl;
    if (p[mijl].sum > x) return cautare_binara(x, 0, mijl - 1);
    if (p[mijl].sum < x) return cautare_binara(x, mijl + 1, dr);
}

int main()
{
    fin >> n >> s;
    for (int i = 0; i < n; i++)
    {
        short x;
        fin >> x;
        mx = max(mx, x);
        v.push_back(x);
    }
    if (6 * (int)mx < s)
    {
        fout << -1;
        return 0;
    }
    if (6 * (int)mx == s)
    {
        for (int i = 0; i < 6; i++)
            fout << mx << " ";
        return 0;
    }

    for (int i = 0; i < v.size(); i++)
        for (int j = 0; j < v.size(); j++)
            for (int k = 0; k < v.size(); k++)
            {
                p.push_back({(int)v[i]+v[j]+v[k], v[i], v[j], v[k]});
            }
    sort(p.begin(), p.end());
    for (int i = 0; i < p.size(); i++)
    {
        int poz = cautare_binara(s - p[i].sum, 0, p.size() - 1);
        if (poz != -1)
        {
            v.clear();
            v.push_back(p[i].a);
            v.push_back(p[i].b);
            v.push_back(p[i].c);
            v.push_back(p[poz].a);
            v.push_back(p[poz].b);
            v.push_back(p[poz].c);
            sort(v.begin(), v.end());
            for (int j = 0; j < v.size(); j++)
                fout << v[j] << " ";
            return 0;
        }
    }
    fout << -1;
    return 0;
}