#include <fstream>
#include <unordered_map>

using namespace std;

ifstream cin("loto.in");
ofstream cout("loto.out");

int v[105];

struct elem {
    int x, y, z;
};

unordered_map <int, elem> f;

int main()
{
    int n, s;
    cin >> n >> s;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    for(int i = 1; i <= n; i ++){
        for(int j = i; j <= n; j ++){
            for(int k = j; k <= n; k ++){
                f[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};
            }
        }
    }
    for(int i = 1; i <= n; i ++){
        for(int j = i; j <= n; j ++){
            for(int k = j; k <= n; k ++) {
                int nr = s - v[i] - v[j] - v[k];
                if (f.count(nr) > 0) {
                    cout << v[i] << " " << v[j] << " " << v[k] << " " << f[nr].x << " " << f[nr].y << " " << f[nr].z;
                    return 0;
                }
            }
        }
    }
    cout << -1;
    return 0;
}