#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>

using namespace std;

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

int sum, n, s;
int arr[100];
unordered_map<int, vector<int>> da;

int main(){
    fin >> n;
    fin >> s;
    for (int i = 0; i < n; i++){
        fin >> arr[i];
    }

    for (int i = 0; i < n; i++){
        for (int j = i; j < n; j++){
            for (int k = j; k < n; k++){
                sum = arr[i] + arr[j] + arr[k];
                da[sum].push_back(arr[i]);
                da[sum].push_back(arr[j]);
                da[sum].push_back(arr[k]);
                if (da.find(s - sum) != da.end()){
                    fout << arr[i] << ' ' << arr[j] << ' ' << arr[k] << ' ';
                    fout << da[s - sum][0] << ' ' << da[s - sum][1] << ' ' << da[s - sum][2];
                    return 0;
                }
            }
        }
    }
    fout << -1;
    return 0;
}