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

using namespace std;

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

unordered_map<int,pair<int,int>> dic;
unsigned int v[100];
int n;
int s;
int i,j,k;

int main()
{

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

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



    for (auto p1: dic)
            if (dic.find(s-p1.first) != dic.end())
            {
                g << p1.second.first << ' ' << p1.second.second << ' ' << p1.first - (p1.second.first+p1.second.second) << ' ' <<
            dic[s-p1.first].first << ' ' << dic[s-p1.first].second << ' ' << s-p1.first - (dic[s-p1.first].first + dic[s-p1.first].second);
                return 0;
            }



    g << -1;

    return 0;
}