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

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

unordered_map<int, tuple<int, int, int>> umap;

int main()
{
    int n, v[101], s, i, j, k, x;
    in>>n>>s;

    for(i = 0; i < n; i++)
        in>>v[i];

    for(i = 0; i < n; i++){
        for(j = i; j < n; j++){
            for(k = j; k < n; k++){
                umap[v[i] + v[j] + v[k]] = {i, j, k};
            }
        }
    }

    for(i = 0; i < n; i++){
        for(j = i; j < n; j++){
            for(k = j; k < n; k++){
                x = s - v[i] - v[j] - v[k];
                if(umap.find(x) != umap.end()){
                    out<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[get<0> (umap[x])]<<" "<<v[get<1> (umap[x])]<<" "<<v[get<2> (umap[x])];
                    return 0;
                }
            }
        }
    }
    out<< -1;
    return 0;
}