#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

ifstream fi("loto.in");
ofstream fo("loto.out");

struct triplet{
    int el1;
    int el2;
    int el3;
};

int n, s;
int numere[101];
unordered_map <int, triplet> sume;

int main()
{
    fi >> n >> s;
    for (int i = 0; i < n; i++){
        fi >> numere[i];
    }
    for (int i = 0; i < n; i++){
        for (int j = i; j < n; j++){
            for (int k = j; k < n; k++){
                int suma = numere[i] + numere[j] + numere[k];
                sume[suma].el1 = numere[i];
                sume[suma].el2 = numere[j];
                sume[suma].el3 = numere[k];
                if (sume.find(s - suma) != sume.end()){
                    fo << numere[i] << " " << numere[j] << " " << numere[k] << " " << sume[s - suma].el1 << " " << sume[s - suma].el2 << " " << sume[s - suma].el3;
                    return 0;
                }
            }
        }
    }
    fo << -1;
    return 0;
}