#include <fstream>
 
#include <algorithm>
 
using namespace std;
 
ifstream f("loto.in");
 
ofstream g("loto.out");
 
#define nmax 101
 
int n, S, a[nmax], v[nmax*nmax*nmax], st, dr, m, p;
 
void afis(int s) {
 
    for (int i = 1; i <= n; ++i) for (int j = i; j <= n; ++j) for (int k = j; k <= n; ++k)
 
        if (s == a[i] + a[j] + a[k]) {
 
            g << a[i] << ' ' << a[j] << ' ' << a[k];
 
            return;
 
        }
 
}
 
int main()
 
{
 
    f >> n >> S;
 
    for (int i = 1; i <= n; ++i) f >> a[i];
 
    for (int i = 1; i <= n; ++i) for (int j = i; j <= n; ++j) for (int k = j; k <= n; ++k)
 
        v[++p] = a[i] + a[j] + a[k];
 
    sort(v+1, v+p+1);
 
    for (int i = 1; i <= p; ++i) {
 
        st = 1, dr = p;
 
        while (st <= dr) {
 
            m = (st + dr) / 2;
 
            if (v[m] == S - v[i]) {
 
                afis(v[i]);
 
                g << ' ';
 
                afis(v[m]);
 
                g << endl;
 
                exit(0);
 
            }
 
            if (v[m] < S - v[i]) st = m + 1;
 
            else dr = m - 1;
 
        }
 
    }
 
    g << "-1\n";
 
    return 0;
 
}