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

int main() {
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    
    int n, tmp, s, ts, rs;
    vector<int> v;
    unordered_map<int, vector<int>> m;

    fin >> n;
    fin >> s;
    for (int i = 0 ; i < n; i++) {
        fin >> tmp;
        v.push_back(tmp);
    }
    fin.close();

    for (int i = 0 ; i < n ; i++ )
        for (int j = i ; j < n ; j++)
            for (int k = j ; k < n ; k++) {
                ts = v[i] + v[j] + v[k];
                m[ts] = {v[i], v[j], v[k]};
                rs = s - ts;
                if (m.find(rs) != m.end()) {
                    for (int e : m[rs])
                        fout << e << " ";
                    for (int e : m[ts])
                        fout << e << " ";
                    return 0;
                }
            }

    fout << -1;
    fout.close();
    return 0;
}