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

struct trio{
    int unu;
    int doi;
    int trei;
};

int main()
{int n ,s,check = 0;
    unordered_map<int,trio> tab;
    fin>>n>>s;
    int v[n];
    for(int i = 0 ; i < n ; i++)
        fin>>v[i];

    for(int i = 0 ; i < n ; i++){
        for(int j = 0 ; j < n ; j++){
            for(int k = 0 ; k < n ; k++){
                int sum = v[i] + v[j] + v[k];
                tab[sum] = {v[i],v[j],v[k]};
                if(tab.find(s - sum) != tab.end()){
                    check = 1;
                    fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<tab[s-sum].unu<<" "<<tab[s-sum].doi<<" "<<tab[s-sum].trei;
                    break;
                }

            }
            if(check)
                break;
        }
        if(check)
            break;
    }
    if(!check)
        fout<<-1;

    fin.close();
    fout.close();
    return 0;
}