#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");

int n, s, v[101], suma;
unordered_map <int, pair <int,int>> loto;
int main()
{
    f >> n >> s;
    for(int i = 0; i < n; i++)
        f >> v[i];
    for(int i = 0; i < n; i++)
        for(int j = i; j < n; j++)
            for(int k = j; k < n; k++){
                suma = v[i] + v[j] + v[k];
                loto[suma] = make_pair(v[i], v[j]);
                suma = s - suma;
                if(loto.find(suma)!=loto.end()){
                    g << v[i] << ' ' << v[j] << ' ' << v[k] << ' ' << loto[suma].first << ' ' << loto[suma].second << ' ' << suma - loto[suma].first - loto[suma].second;
                    return 0;
                }

            }
    g << "-1";
    return 0;
}