#include <unordered_map>
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("loto.in");
ofstream fout ("loto.out");
const int NMAX = 103;
int v [NMAX], n, S, sum;
struct BoB{
    int a;
    int b;
    int c;
};
unordered_map <int, BoB> mp;
int main (){
    fin >> n >> S;
    for (int i = 1; i <= n; i ++)
        fin >> v [i];
    for (int i = 1; i <= n; i ++){
        for (int j = 1; j <= n; j ++){
            for (int p = 1; p <= n; p ++){
                sum = v [i] + v [j] + v [p];
                mp [sum] = {v [i], v [j], v [p]};
                if (mp.find (S - sum) != mp.end ()){
                    fout << v [i] << " " << v [j] << " " << v [p]  << " " << mp [S - sum].a << " " << mp [S - sum].b << " " << mp [S - sum].c;
                    return 0;
                }
            }
        }
    }
    fout << -1;
    return 0;
}