#include <bits/stdc++.h>

#define F first
#define S second
#define mp make_pair

using namespace std;

const int Nmax = 110;

int n , s , i , STEP;
int a[Nmax];

unordered_map < int , bool > Hash;
vector < pair < int , pair < int , pair < int , int > > > > v;

int search_(int x)
{
    int i , step = STEP;

    for (i = -1; step; step >>= 1)
        if (i + step < v.size() && v[i+step].F < x)
            i += step;

    return i + 1;
}

void solve(bool mode)
{
    int i , j , k;

    for (i = 1 ; i <= n; ++i)
        for (j = 1; j <= n; ++j)
            for (k = 1; k <= n; ++k)
            {

                int sum = a[i] + a[j] + a[k];
                if (!mode && Hash[sum] == 0)
                    Hash[sum] = 1,
                    v.push_back({sum , {a[i] , {a[j] , a[k]}}});
                else if (mode)
                {
                    if (Hash[s-sum] == 1)
                    {
                        int it = search_(s-sum);
                        printf("%d %d %d %d %d %d\n", a[i] , a[j] , a[k], v[it].S.F , v[it].S.S.F , v[it].S.S.S);
                        return;
                    }
                }
            }

    if (mode) printf("-1\n");
    if (!mode) sort(v.begin() , v.end());
}

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

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

    for (i = 1; i <= n; ++i)
        scanf("%d", a + i);

    solve(0);
    for (STEP = 1; STEP < v.size(); STEP <<= 1);
    solve(1);

    return 0;
}