#include <bits/stdc++.h>

using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct trip {
    int a, b, c;
    friend ostream& operator <<(ostream& out, const trip& x) { return out << x.a << " " << x.b << " " << x.c; }
};
unordered_map <int, trip> r;

int main()
{
    int n, x, s;
    fin >> n >> s;
    vector <int> v(n);
    for(int i = 1; i <= n; i++)
        fin >> x,
        v[i - 1] = x;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
                r[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};
    bool flag = true;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++) {
                x = v[i] + v[j] + v[k];
                if(r.count(s - x)) {
                    fout << r[x] << " " << r[s - x];
                    return 0;
                }
            }
    fout << "-1";
    return 0;
}