#include <bits/stdc++.h>

using namespace std;

int v[101];

unordered_map<int, tuple<int, int, int>> m;

int main()
{
    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);

    int n, s;
    short i, j ,k;
    bool ok=0;

    scanf("%d %d", &n, &s);

    for(i=0; i<n; ++i)
    {
        scanf("%d", &v[i]);
    }

    for(i=0; i<n && !ok; ++i)
    {
        for(j=i; j<n && !ok; ++j)
        {
            for(k=j; k<n && !ok; ++k)
            {
                int sum = v[i] + v[j] + v[k];
                if(sum < s)
                {
                    m[sum] = {v[i], v[j], v[k]};
                    if(m.find(s - sum) != m.end())
                    {
                        printf("%d %d %d %d %d %d", v[i], v[j], v[k], get<0>(m[s-sum]), get<1>(m[s-sum]), get<2>(m[s-sum]));
                        ok = 1;
                    }
                }
            }
        }
    }

    if(!ok)
        printf("-1");

    return 0;
}