#include <bits/stdc++.h>
#define nmax 100
#pragma GCC optimize("O3")

using namespace std;

int v[nmax + 1], sol[7];
struct grup
{
    int a, b, c;
};
unordered_map<int, grup> f;

int main()
{
    ifstream cin("loto.in");
    ofstream cout("loto.out");
    int n, s, i, j, k;
    ios_base::sync_with_stdio(0);
    cin >> n >> s;
    for (i = 1; i <= n; i++)
        cin >> v[i];
    for (i = 1; i <= n; i++)
        for (j = i; j <= n; j++)
            for (k = j; k <= n; k++)
                if (f[s - (v[i] + v[j] + v[k])].a != 0)
                {
                    sol[1] = v[i], sol[2] = v[j], sol[3] = v[k];
                    sol[4] = f[s - (v[i] + v[j] + v[k])].a, sol[5] = f[s - (v[i] + v[j] + v[k])].b, sol[6] = f[s - (v[i] + v[j] + v[k])].c;
                    sort(sol + 1, sol + 6 + 1);
                    for (i = 1; i <= 6; i++)
                        cout << sol[i] << " ";
                    return 0;
                }
                else
                    f[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};
    cout << -1;
    return 0;
}