#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>

using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main() {


    int N;
    long long S;
    fin >> N >> S;

    vector<long long> loto(N);
    unordered_map<long long, vector<long long>> solve;
    bool found = false;

    for (int i = 0; i < N; i++) {
        fin >> loto[i];
    }

    for (int i = 0; i < N && !found; i++) {
        for (int j = 0; j < N && !found; j++) {
            for (int k = 0; k < N && !found; k++) {
                long long sum = loto[i] + loto[j] + loto[k];
                solve[sum] = {loto[i], loto[j], loto[k]};
                long long minus = S - sum;

                if (solve.count(minus)) {
                    fout << solve[sum][0] << " " << solve[sum][1] << " " << solve[sum][2] << " " << solve[minus][0] << " " << solve[minus][1] << " " << solve[minus][2];
                    found = true;
                    }
            }
        }
    }

    if (!found) {
        fout << -1;
    }

    fin.close();
    fout.close();

    return 0;
}