#include <fstream>

using namespace std;

const int K = 1 << 20;
const int N = 100;
const int NS = 1e6;

struct element
{
    int val, urm;
};

element v[NS+1];
int nr_e, lst[K], x[N];

bool exista(int val)
{
    int c = val & (K - 1);
    for (int p = lst[c]; p != 0; p = v[p].urm)
    {
        if (v[p].val == val)
        {
            return true;
        }
    }
    return false;
}

void adauga(int val)
{
    if (exista(val))
    {
        return;
    }
    int c = val & (K - 1);
    ++nr_e;
    v[nr_e].val = val;
    v[nr_e].urm = lst[c];
    lst[c] = nr_e;
}

void afis(ofstream &out, int n, int s)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            for (int k = 0; k < n; k++)
            {
                if (x[i] + x[j] + x[k] == s)
                {
                    out << x[i] << " " << x[j] << " " << x[k] << "\n";
                    return;
                }
            }
        }
    }
}

int main()
{
    ifstream in("loto.in");
    ofstream out("loto.out");
    int n, s;
    in >> n >> s;
    for (int i = 0; i < n; i++)
    {
        in >> x[i];
    }
    in.close();
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            for (int k = 0; k < n; k++)
            {
                adauga(x[i] + x[j] + x[k]);
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            for (int k = 0; k < n; k++)
            {
                if (s - x[i] - x[j] - x[k] > 0 && exista(s - x[i] - x[j] - x[k]))
                {
                    out << x[i] << " " << x[j] << " " << x[k] << " ";
                    afis(out, n, s - x[i] - x[j] - x[k]);
                    out.close();
                    return 0;
                }
            }
        }
    }
    out << -1;
    out.close();
    return 0;
}