#include <bits/stdc++.h>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
struct triplu
{
int a, b, c;
};
int n, S, A[105];
map<int, triplu> sum;
int main()
{
    f >> n >> S;
    for(int i = 1; i <= n; i ++)
        f >> A[i];

    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            for(int k = 1; k <= n; k ++)
                sum[A[i] + A[j] + A[k]] = {A[i], A[j], A[k]};

    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            for(int k = 1; k <= n; k ++)
            {
                if(sum.count(S - (A[i] + A[j] + A[k])))
                {
                    g << sum[S - (A[i] + A[j] + A[k])].a << " ";
                    g << sum[S - (A[i] + A[j] + A[k])].b << " ";
                    g << sum[S - (A[i] + A[j] + A[k])].c << " ";
                    g << A[i] << " " << A[j] << " " << A[k];
                    return 0;
                }
            }
    g << -1;
    return 0;
}