#include <bits/stdc++.h>

#define maxn 105

std::vector<int> sol;
int nr[maxn];
std::vector<int> res;
int n;

std::ifstream fin("loto.in");
std::ofstream fout("loto.out");

void afis(int index)
{
    for(int i = 0; i < n; i++)
        for(int j = i; j < n; j++)
            for(int k = j; k < n; k++)
                if(sol[index] == nr[i] + nr[j] + nr[k])
                {
                    res.push_back(nr[i]);
                    res.push_back(nr[j]);
                    res.push_back(nr[k]);
                }
}

int main()
{
    int S;
    fin >> n >> S;
    long long int cnt = 0;
    for (int i = 0; i < n; i++)
        fin >> nr[i];
    for(int i = 0; i < n; i++)
        for(int j = i; j < n; j++)
            for(int k = j; k < n; k++)
                sol.push_back(nr[i] + nr[j] + nr[k]);
    std::sort(sol.begin(), sol.end());
    int i = 0, j = sol.size() - 1;
    while(i <= j){
        if(sol[i] + sol[j] == S)
        {
            afis(i);
            afis(j);
            std::sort(res.begin(), res.end());
            for(int i = 0; i < res.size(); i++)
                fout << res[i] << " ";
            return 0;
        }
        if(sol[i] + sol[j] > S)
        {
            j--;
        }
        if(sol[i] + sol[j] < S){
            i++;
        }
    }
    fout << "-1";
}