#include <bits/stdc++.h>
using namespace std;
/**

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

struct trei
{
    int i, j, k;
};

int a[103], n, s;
unordered_map<int, trei> M;

int main()
{
    int i, j, k, x;
    fin >> n >> s;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    for (i = 1; i <= n; i++)
        for (j = i; j <= n; j++)
            for (k = j; k <= n; k++)
                M[a[i] + a[j] + a[k]] = { a[i], a[j], a[k] };
    for (i = 1; i <= n; i++)
        for (j = i; j <= n; j++)
            for (k = j; k <= n; k++)
            {
                x = s - a[i] - a[j] - a[k];
                if (M[x].i + M[x].j + M[x].k + a[i] + a[j] + a[k] == s)
                {
                    fout << M[x].i << " " << M[x].j << " " << M[x].k << " " << a[i] << " " << a[j] << " " << a[k] << "\n";
                    fout.close();
                    return 0;
                }
            }
    fout << "-1\n";
    fout.close();
    return 0;
}