#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");

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

int main() {
    unordered_map<int, trei> sume;
    int n, s, v[101];
    fin>>n>>s;
    for (int i = 0; i < n; ++i) {
        fin>>v[i];
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
            for (int k = j; k < n; ++k) {
                trei t;
                t.x = v[i];
                t.y = v[j];
                t.z = v[k];
                int sum = v[i] + v[j] + v[k];
                sume[sum] = t;
                if (sume.find(s - sum) != sume.end()){
                    fout<<sume[sum].x<<' '<<sume[sum].y<<' '<<sume[sum].z<<' '<<sume[s - sum].x<<' '<<sume[s - sum].y<<' '<<sume[s - sum].z;
                    return 0;
                }
            }
        }
    }
    fout<<-1;
    return 0;
}