#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
unordered_map <int, bool> exista;
const int maxn = 605;
int v[maxn];
int main()
{
    int n, s;
    in >> n >> s;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    for(int i = 1; i <= n; i++)
        for(int j = i; j <= n; j++)
            for(int k = j; k <= n; k++)
                exista[v[i] + v[j] + v[k]] = 1;
    int cauta = -1;
    for(int i = 1; i <= n; i++)
    {
        for(int j = i; j <= n; j++)
        {
            for(int k = j; k <= n; k++)
            {
                if(exista[s - v[i] - v[j] - v[k]] == 1)
                {
                    out << v[i] << " " << v[j] << " " << v[k] << " ";
                    cauta = s - v[i] - v[j] - v[k];
                    j = n + 1;
                    i = n + 1;
                    break;
                }
            }
        }
    }
    if(cauta == -1)
    {
        out << -1 << "\n";
        return 0;
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = i; j <= n; j++)
        {
            for(int k = j; k <= n; k++)
            {
                if(v[i] + v[j] + v[k] == cauta)
                {
                    out << v[i] << " " << v[j] << " " << v[k] << "\n";
                    return 0;
                }
            }
        }
    }
    return 0;
}