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

using namespace std;

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

unordered_map<int,int> dic;
unsigned int v[105];
int n;
int s;
int i,j;

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)
            dic[v[i]+v[j]] = v[i];



    for (auto p1: dic)
        for (auto p2:dic)
        {

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



    g << -1;

    return 0;
}